qsort函数的各类型排序及冒泡的思想模拟实现该函数

1.整形类型排序

void print(float* arr, int siz)
{
	int i = 0;
	for (i = 0; i < siz; i++)
	{
		printf("%d ", arr[i]);
	}
}
int sort_test(void* p1, void* p2)//实现排序方式函数的接收类型要void* 返回类型是整形p2>p1返回>0的值，p2=p1返回0；p2<p1返回<0的值
{
	return *((int*)p2) - *((int*)p1);
}

test()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9 };
	int siz = sizeof(arr) / sizeof(arr[0]);
	qsort(arr, siz, sizeof(arr[0]), sort_test);
	print(arr, siz);
}
int main()
{
   test();

   return 0;
}

2.字符类型排序

int sort_test2(void* p1, void* p2)
{
	return *((char*)p1)-*((char*)p2);
}
test2()
{
	char arr[] = "aetrfgf";
	int len = strlen(arr);
	qsort(arr, len, sizeof(arr[0]), sort_test2);
	printf("%s", arr);
}
int main()
{
    test2()
    return 0;
}

3.浮点型排序

void print(float* arr, int siz)
{
	int i = 0;
	for (i = 0; i < siz; i++)
	{
		printf("%.2lf ", arr[i]);
	}
}
int sort_test3(void* p1, void* p2)
{
	return *((float*)p1) - *((float*)p2);
}
test3()
{
	float arr[] = { 3.14,52.65,89.25,45.21,55.002,0.014 };
	int siz = sizeof(arr) / sizeof(arr[0]);
	qsort(arr, siz, sizeof(arr[0]), sort_test3);
	print(arr, siz);
}

int main()
{
    test3
    return 0;
}

4.结构体类型排序

struct stu
{
	char name[20];
	int age;
};
int sort_name(void* p1, void* p2)
{
	return strcmp(((struct stu*)p1)->name, ((struct stu*)p2)->name);//strcmp返回的规则跟qsort是一样的。
}
int sort_age(void* p1, void* p2)
{
	return ((struct stu*)p1)->age-((struct stu*)p2)->age;
}
test4()
{
	struct stu s[] = { {"zhangsang",40},{"wangming",25},{"lisi",33} };
	int siz = sizeof(s) / sizeof(s[0]);
	//按名字排序
	qsort(s, siz, sizeof(s[0]), sort_name);
	//按年龄排序
	qsort(s, siz, sizeof(s[0]), sort_age);
}
int main()
{
    test4();
    return 0;
]

5.使用冒泡的思想模拟实现qsort函数

//模仿qsort的功能实现一个通用的冒泡排序
#include<assert.h>
int cmp_int(const void* p1, const void* p2)
{
	return *((int*)p1) - *((int*)p2);
}
void print(int* arr, int siz)
{
	int i = 0;
	for (i = 0; i < siz; i++)
	{
		printf("%d ", arr[i]);
	}
}
void swap(char* base, char* base2, int siz)
{
	assert(base && base2);
	int i = 0;
	for (i = 0; i < siz; i++)
	{
		char tmp = *base;
		*base = *base2;
		*base2 = tmp;
		base++;
		base2++;
	}
}
void my_qsort(void* base,size_t num,size_t siz, int (*comp)(const void* p1, const void* p2))
{
	size_t i = 0;
	size_t j = 0;
	for(i = 0; i < num - 1; i++)
	{
		
		for (j = 0; j < num - 1 - i; j++)
		{
			//两个相邻元素比较
			if (comp((char*)base + j*siz, (char*)base + (j + 1) * siz )> 0)
			{
				//交换
				swap((char*)base + j * siz, (char*)base + (j + 1) * siz,siz);
			}
		}
	}
}
test()
{
	int arr[] = { 10,9,8,7,6,5,4,3,2,1 };
	int siz = sizeof(arr) / sizeof(arr[0]);
	my_qsort(arr, siz, sizeof(arr[0]), cmp_int);
	print(arr, siz);
}
int main()
{
	test();
	return 0;
}