如何用C语言实现通用的冒泡排序算法

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

// 通用比较函数的类型
typedef int (*CompareFunc)(const void *, const void *);

// 通用冒泡排序函数
void bubbleSort(void *base, size_t num, size_t size, CompareFunc compare) {
    unsigned char *arr = (unsigned char *)base;
    
    for (size_t i = 0; i < num - 1; i++) {
        int swapped = 0;
        
        for (size_t j = 0; j < num - i - 1; j++) {
            unsigned char *a = arr + j * size;
            unsigned char *b = arr + (j + 1) * size;
            
            if (compare(a, b) > 0) {
                unsigned char temp[size];
                memcpy(temp, a, size);
                memcpy(a, b, size);
                memcpy(b, temp, size);
                
                swapped = 1;
            }
        }
        
        if (!swapped) {
            break;
        }
    }
}

// 示例比较函数：用于排序整数
int compareInt(const void *a, const void *b) {
    return (*(int *)a - *(int *)b);
}

// 示例比较函数：用于排序浮点数
int compareFloat(const void *a, const void *b) {
    if (*(float *)a < *(float *)b) return -1;
    if (*(float *)a > *(float *)b) return 1;
    return 0;
}

// 打印数组的函数
void printArray(void *base, size_t num, size_t size, void (*printElem)(const void *)) {
    unsigned char *arr = (unsigned char *)base;
    for (size_t i = 0; i < num; i++) {
        printElem(arr + i * size);
    }
    printf("\n");
}

// 打印整数数组元素
void printInt(const void *a) {
    printf("%d ", *(int *)a);
}

// 打印浮点数数组元素
void printFloat(const void *a) {
    printf("%.2f ", *(float *)a);
}

int main() {
    // 测试整数数组
    int arrInt[] = {64, 34, 25, 12, 22, 11, 90};
    size_t numInt = sizeof(arrInt) / sizeof(arrInt[0]);
    
    printf("排序前的整数数组: ");
    printArray(arrInt, numInt, sizeof(int), printInt);
    
    bubbleSort(arrInt, numInt, sizeof(int), compareInt);
    
    printf("排序后的整数数组: ");
    printArray(arrInt, numInt, sizeof(int), printInt);

    // 测试浮点数数组
    float arrFloat[] = {64.5, 34.2, 25.1, 12.9, 22.7, 11.6, 90.3};
    size_t numFloat = sizeof(arrFloat) / sizeof(arrFloat[0]);
    
    printf("排序前的浮点数数组: ");
    printArray(arrFloat, numFloat, sizeof(float), printFloat);
    
    bubbleSort(arrFloat, numFloat, sizeof(float), compareFloat);
    
    printf("排序后的浮点数数组: ");
    printArray(arrFloat, numFloat, sizeof(float), printFloat);

    return 0;
}