qsort模拟实现各种排序–不知道类型–运用冒泡排序
#include<stdio.h>
#include<string.h>
struct Stu
{
char name[20];
int age;
};
int cmp_int(const void* e1, const void* e2)//整型
{
return *(int*)e1 - *(int*)e2;
}
int sort_by_age(const void* e1, const void* e2)//整型(结构体)
{
return ((struct Stu*)e1)->age - ((struct Stu*)e2)->age;
}
int sort_by_name(const void*e1, const void*e2)//字符串(结构体)
{
return strcmp(((struct Stu*)e1)->name, ((struct Stu*)e2)->name);
}
int char_cmp(const void *x, const void *y) //字符型
{
return (*(char *)x) - (*(char *)y);
}
void Swap(char*buf1, char*buf2, int width)
{
int i = 0;
for (i = 0; i < width; i++)
{
char tmp = *buf1;
*buf1 = *buf2;
*buf2 = tmp;
buf1++;
buf2++;
}
}
void bubble_sort(void* base,int sz,int width,int (*cmp)(const void*e1, const void*e2) )
{
int i = 0;
//趟数
for (i = 0; i < sz - 1; i++)
{
//一趟的排序
int j = 0;
for (j = 0; j < sz - 1 - i; j++)
{
//两个元素比较
//arr[j] arr[j+1]
if (cmp( (char*)base+j*width, (char*)base+(j+1)*width )>0)
{
//交换
Swap((char*)base + j * width, (char*)base + (j + 1) * width, width);
}
}
}
}
void test1()
{
//整形数据的排序
int arr[] = { 1,3,5,7,9,2,4,6,8,0 };
int sz = sizeof(arr) / sizeof(arr[0]);
//排序
bubble_sort(arr, sz, sizeof(arr[0]), cmp_int);
//打印
int i = 0;
printf("整型数据排序有:");
for (i = 0; i < sz; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void test2()
{
//使用qsort函数排序结构体数据
struct Stu s[3] = { {"kk", 30},{"aa", 34},{"cc", 20} };
int sz = sizeof(s) / sizeof(s[0]);
//按照年龄来排序
bubble_sort(s, sz, sizeof(s[0]), sort_by_age);
printf("结构体按照age来排序:");
int i=0;
for (i = 0; i <3; i++)
{
printf("%d%s ", s[i].age,s[i].name);
}
printf("\n");
//按照名字来排序
printf("结构体按照name来排序:");
bubble_sort(s, sz, sizeof(s[0]), sort_by_name);
for (i = 0; i <3; i++)
{
printf("%s%d ", s[i].name, s[i].age);
}
printf("\n");
}
void test3()
{
char arr2[5] = { 'c', 'k', 'b', 'a', 'z' };
int sz = sizeof(arr2) / sizeof(arr2[0]);
bubble_sort(arr2, sz, sizeof(arr2[0]), char_cmp);
int i = 0;
printf("字符排序:");
for (i = 0; i < 5; i++)
{
printf("%c ", arr2[i]);
}
}
int main()
{
test1();
test2();
test3();
return 0;
}