模仿qsort的功能实现一个通用的冒泡排序

---

模仿qsort的功能实现一个通用的冒泡排序

---

程序代码如下：

---

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

int cmp1(const void *a, const void *b)
{
    assert(a);
    assert(b);
    return (*(unsigned char *)a - *(unsigned char *)b);
}

int cmp2(const void *a, const void *b)
{
    assert(a);
    assert(b);
    return strcmp((char *)*(int *)a, (char *)*(int *)b);
}

int cmp3(const void *a, const void *b)
{
    assert(a);
    assert(b);
    return (*(unsigned int *)a - *(unsigned int *)b);;
}

int cmp4(const void *a, const void *b)
{
    assert(a);
    assert(b);
    return (((*(double *)a - *(double *)b) > 0) ? 1 : -1);
}

void MySwap(void *p1, void *p2, int size)
{
    assert(p1);
    assert(p2);
    int i = 0;
    for (i = 0; i < size; i++)
    {
        char tmp = *((char *)p1 + i);
        *((char *)p1 + i) = *((char *)p2 + i);
        *((char *)p2 + i) = tmp;
    }
}

void Bubble(void *base, int count, int size, int(*cmp)(void *, void *))
{
    assert(base);
    assert(cmp);
    int i = 0;
    int j = 0;
    for (i = 0; i < count - 1; i++)
    {
        for (j = 0; j < count - 1; j++)
        {
            if (cmp((char *)base + j*size, (char *)base + (j + 1)*size)>0)
            {
                MySwap((char *)base + j*size, (char *)base + (j + 1)*size, size);
            }
        }
    }

}

int main()
{
    int i = 0;
    char c[10] = "adicfjgheb";
    char *s[5] = { "aaa", "ddd", "iii", "ccc", "fff" };
    /*char c[10] = { 'a', 'c', 'i', 'e', 'b', 'j', 'f', 'h', 'd', 'g' };*/
    int a[10] = { 1, 3, 4, 5, 8, 0, 9, 7, 2, 6 };
    double b[10] = { 0.3, 1.7, 2.5, 0.1, 3.9, 2.1, 0.4, 0.2, 1.5, 2.3 };
    Bubble(c, 10, sizeof(char), cmp1);
    Bubble(s, 5, sizeof(char *), cmp2);
    Bubble(a, 10, sizeof(int), cmp3);
    Bubble(b, 10, sizeof(double), cmp4);
    for (i = 0; i < 10; i++)
    {
        printf("%c ", c[i]);
    }
    printf("\n");
    for (i = 0; i < 5; i++)
    {
        printf("%s ", s[i]);
    }
    printf("\n");
    for (i = 0; i < 10; i++)
    {
        printf("%d ", a[i]);
    }
    printf("\n");
    for (i = 0; i < 10; i++)
    {
        printf("%lf ", b[i]);
    }
    printf("\n");
    return 0;
}

---

程序运行结果如下：

---