快速排序(使用pthread)只对数组的一半进行排序

#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>

#define MAX_SIZE 100

typedef struct {
    int* arr;
    int left;
    int right;
} SortArgs;

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

int partition(int* arr, int left, int right) {
    int pivot = arr[right];
    int i = left - 1;

    for (int j = left; j <= right - 1; j++) {
        if (arr[j] <= pivot) {
            i++;
            swap(&arr[i], &arr[j]);
        }
    }

    swap(&arr[i + 1], &arr[right]);
    return i + 1;
}

void* quickSort(void* arg) {
    SortArgs* args = (SortArgs*)arg;
    int left = args->left;
    int right = args->right;
    int* arr = args->arr;

    if (left < right) {
        int pivot = partition(arr, left, right);

        SortArgs args1 = {arr, left, pivot - 1};
        SortArgs args2 = {arr, pivot + 1, right};

        pthread_t thread1, thread2;
        pthread_create(&thread1, NULL, quickSort, (void*)&args1);
        pthread_create(&thread2, NULL, quickSort, (void*)&args2);

        pthread_join(thread1, NULL);
        pthread_join(thread2, NULL);
    }

    pthread_exit(NULL);
}

void printArray(int* arr, int size) {
    for (int i = 0; i < size; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

int main() {
    int arr[MAX_SIZE];
    int size;

    printf("Enter the size of the array: ");
    scanf("%d", &size);

    printf("Enter the elements of the array: ");
    for (int i = 0; i < size; i++) {
        scanf("%d", &arr[i]);
    }

    SortArgs args = {arr, 0, size - 1};
    pthread_t thread;
    pthread_create(&thread, NULL, quickSort, (void*)&args);
    pthread_join(thread, NULL);

    printf("Sorted array: ");
    printArray(arr, size);

    return 0;
}