如何在排序后将未排序的数组保留在C中

#include <stdio.h>
#include <stdbool.h>

void swap(int* a, int* b) {
    int temp = *a;
    *a = *b;
    *b = temp;
}

int partition(int arr[], int low, int high) {
    int pivot = arr[high];
    int i = low - 1;
  
    for (int j = low; j < high; j++) {
        if (arr[j] < pivot) {
            i++;
            swap(&arr[i], &arr[j]);
        }
    }
    swap(&arr[i + 1], &arr[high]);
    return (i + 1);
}

void quickSort(int arr[], int low, int high) {
    if (low < high) {
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

void retainUnsortedArray(int arr[], int size) {
    int* temp = malloc(size * sizeof(int));
    bool* sorted = malloc(size * sizeof(bool));
    
    for (int i = 0; i < size; i++) {
        temp[i] = arr[i];
        sorted[i] = false;
    }
    
    quickSort(temp, 0, size - 1);
    
    for (int i = 0; i < size; i++) {
        for (int j = 0; j < size; j++) {
            if (arr[i] == temp[j]) {
                sorted[j] = true;
                break;
            }
        }
    }
    
    int index = 0;
    for (int i = 0; i < size; i++) {
        if (!sorted[i]) {
            arr[index++] = temp[i];
        }
    }
    
    free(temp);
    free(sorted);
}

int main() {
    int arr[] = {5, 2, 1, 4, 3};
    int size = sizeof(arr) / sizeof(arr[0]);
    
    retainUnsortedArray(arr, size);
    
    printf("Unsorted array retained: ");
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }
    
    return 0;
}