pthread线程池实现并行快速排序 c++

下面是基于pthread的线程池实现并行快速排序的C代码：

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

#define MAX_THREADS 16
#define MAX_SIZE 1024

int data[MAX_SIZE];
int n, m;

struct arg_struct {
    int start;
    int end;
};

void *quicksort(void *arg) {
    struct arg_struct *args = (struct arg_struct *) arg;
    int start = args->start;
    int end = args->end;
    int pivot = data[end];
    int i = start - 1;
    int j, tmp;
    if (start >= end) {
        return NULL;
    }
    for (j = start; j < end; j++) {
        if (data[j] < pivot) {
            i++;
            tmp = data[i];
            data[i] = data[j];
            data[j] = tmp;
        }
    }
    tmp = data[i + 1];
    data[i + 1] = data[end];
    data[end] = tmp;
    struct arg_struct left_args = {start, i};
    struct arg_struct right_args = {i + 2, end};
    pthread_t left_thread, right_thread;
    if (m < MAX_THREADS - 1) {
        m += 2;
        pthread_create(&left_thread, NULL, quicksort, (void *) &left_args);
        pthread_create(&right_thread, NULL, quicksort, (void *) &right_args);
        pthread_join(left_thread, NULL);
        pthread_join(right_thread, NULL);
        m -= 2;
    } else {
        quicksort((void *) &left_args);
        quicksort((void *) &right_args);
    }
    return NULL;
}

int main() {
    int i;
    printf("Enter number of elements: ");
    scanf("%d", &n);
    printf("Enter elements: ");
    for (i = 0; i < n; i++) {
        scanf("%d", &data[i]);
    }
    struct arg_struct args = {0, n - 1};
    m = 1;
    quicksort((void *) &args);
    printf("Sorted array: ");
    for (i = 0; i < n; i++) {
        printf("%d ", data[i]);
    }
    printf("\n");
    return 0;
}

该程序通过输入一组数据，利用快速排序算法进行排序，利用pthread库实现线程池，将排序任务分配给多个线程进行并行处理。程序中定义了一个结构体arg_struct用于传递给线程的参数，其中包括排序起点和终点。当线程池中线程数小于最大线程数时，创建两个新线程进行递归排序；否则，直接进行递归排序。最终输出排序结果。