qsort实现一个通用的冒泡排序,排序各种类型的数据详细说明,有整型,浮点型,字符型等。
1.代码
代码如下(示例):
#include<stdio.h>
#include<string.h>
#pragma warning (disable:4996)
int int_cmp(const void *p1, const void *p2)//整型
{
return (*(int *)p1>*(int *)p2);
}
int char_cmp(const void *x, const void *y) //字符型
{
return (*(char *)x) - (*(char *)y);
}
int str_cmp(const void *x, const void* y) //字符串型
{
return strcmp(*(char **)x, *(char **)y);
}
int double_cmp(const void *x, const void *y) //浮点型
{
return (*(double*)x) - (*(double*)y);
}
void _swap(void *p1, void *p2, int size){
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 *)){
int i = 0;
int j = 0;
for (i = 0; i < count - 1; i++){
for (j = 0; j < count - i - 1; j++){
if (int_cmp((char *)base + j*size, (char *)base + (j + 1)*size)>0){
_swap((char *)base+j*size,(char *)base+(j+1)*size,size);
}
}
}
}
int main()
{
int arr[] = {1,3,5,7,9,2,4,6,8,0};
int i = 0;
bubble(arr,sizeof(arr)/sizeof(arr[0]),sizeof(int),int_cmp);
for (i = 0; i < sizeof(arr) / sizeof(arr[0]); i++){
printf("%d ",arr[i]);
}
printf("\n");
char arr2[] = { 'a', 'b', 'g', 'q', 'Z', 'Y', 'X' };
qsort(arr2, sizeof(arr2) / sizeof(arr2[0]), sizeof(arr2[0]), char_cmp);
for (i = 0; i < sizeof(arr2) / sizeof(arr2[0]); i++)
{
printf("%c ", arr2[i]);
}
printf("\n");
char *arr3[] = { "abc", "teas", "FADE", "hui", "BLUE", "SIT" };
qsort(arr3, sizeof(arr3) / sizeof(*arr3), sizeof(*arr3), str_cmp);
for (i = 0; i < sizeof(arr3) / sizeof(*arr3); i++)
{
printf("%s ", arr3[i]);
}
printf("\n");
double arr4[] = { 2.61, 18.6, 40.2, 33.78, 26.15, 80.26, 5.20};
qsort(arr4, sizeof(arr4) / sizeof(arr4[0]), sizeof(arr4[0]), double_cmp);
for (i = 0; i < sizeof(arr4) / sizeof(arr4[0]); i++)
{
printf("%.3f ", arr4[i]);
}
printf("\n");
system("pause");
return 0;
}
2.结果分析
结果如下: