如何对泛型(void*)数组进行排序？

// 比较函数示例
int compare(const void* a, const void* b) {
    // 转换为实际类型并进行比较
    int* pa = (int*)a;
    int* pb = (int*)b;
    return (*pa - *pb);
}

// 快速排序函数
void quickSort(void** arr, int low, int high, int (*compare)(const void*, const void*)) {
    if (low < high) {
        int pivot = partition(arr, low, high, compare);
        quickSort(arr, low, pivot - 1, compare);
        quickSort(arr, pivot + 1, high, compare);
    }
}

// 划分函数
int partition(void** arr, int low, int high, int (*compare)(const void*, const void*)) {
    void* pivot = arr[low];
    int i = low;
    int j = high + 1;
    
    while (true) {
        while (compare(arr[++i], pivot) < 0) {
            if (i == high) break;
        }
        
        while (compare(arr[--j], pivot) > 0) {
            if (j == low) break;
        }
        
        if (i >= j) break;
        
        swap(arr[i], arr[j]);
    }
    
    swap(arr[low], arr[j]);
    return j;
}

// 示例用法
void exampleUsage() {
    int arr[5] = {5, 4, 3, 2, 1};
    void* arrPtr[5];
    
    // 将数组元素转换为泛型指针
    for (int i = 0; i < 5; i++) {
        arrPtr[i] = &arr[i];
    }
    
    // 对泛型(void*)数组进行排序
    quickSort(arrPtr, 0, 4, compare);
    
    // 输出排序后的结果
    for (int i = 0; i < 5; i++) {
        printf("%d ", *(int*)arrPtr[i]);
    }
}