一、qsort函数
void qsort(void* base,size_t num,size_t width, int(_cdecl* compare)(const
void* elem1, const void* elem2));
包含头文件为#include<stdlib.h>
二、qsort函数的使用
qsort函数的作用:快速排序
qsort函数的参数:
- 无类型指针,数组的首元素地址
- 数组的元素个数
- 数组每个元素占的字节数
- 函数指针,函数指针所指向的函数返回类型为int,参数为无类型指针(函数自己定义)
#include<stdio.h>
#include<stdlib.h>
int sort(const void* e1, const void* e2)
{
return *(int*)e1 - *(int*)e2;
}
int sort2(const void* e1, const void* e2)
{
return *(char*)e1 - *(char*)e2;
}
int main()
{
int arr1[10] = { 5,5,7,1,2,4,6,8,4,9 };
char arr2[10] = "sdfgacbeh";
//对int数组进行快速排序
qsort(arr,10,sizeof(int),sort1);
//对char数组进行快速排序
qsort(arr, 10, sizeof(char), sort2);
for (int i = 0; i < 10; i++)
{
printf("%d ", arr1[i]);
}
for (int i = 0; i < 10; i++)
{
printf("%c ", arr2[i]);
}
}
三、通过冒泡排序实现qsort函数
int sort1(const void* e1, const void* e2)
{
return *(int*)e1 - *(int*)e2;
}
int sort2(const void* e1, const void* e2)
{
return *(char*)e1 - *(char*)e2;
}
void my_qsort(void* base, size_t num, size_t width,
int(*sort)(const void* e1, const void* e2))
{
for (int i = 0; i < (int)num - 1; i++)
{
for (int j = 0; j < (int)num - 1 - i; j++)
{
if (sort((char*)base+j*width, (char*)base+(j+1) * width)>0)
{
for (int i = 0; i < (int)width; i++)
{
char temp = ((char*)base + j * width)[i];
((char*)base + j * width)[i] = \
((char*)base + (j + 1) * width)[i];
((char*)base + (j + 1) * width)[i] = temp;
}
}
}
}
}
int main()
{
int arr1[10] = { 5,5,7,1,2,4,6,8,4,9 };
my_qsort(arr1,10,sizeof(int),sort1);
for (int i = 0; i < 10; i++)
{
printf("%d ", arr1[i]);
}
printf("\n");
char arr2[10] = "sdfgacbeh";
my_qsort(arr2, 10, sizeof(char), sort2);
for (int i = 0; i < 10; i++)
{
printf("%c ", arr2[i]);
}
}