一:使⽤qsort函数排序整型数据:
#include <stdio.h>
#include <string.h>
void SR(int arr[], int sz)
{
int i = 0;
for (i = 0; i < sz; i++)
{
scanf("%d", &arr[i]);
}
}
//int P(const void* p1, const void* p2)
//{
// return *(int*)p1 - *(int*)p2;
//}
//P函数的两种书写方法
int P(const void* p1, const void* p2)
{
if ((*(int*)p1) > (*(int*)p2))
return 1;
else if ((*(int*)p1) < (*(int*)p2))
return -1;
else
return 0;
}
void print_arr(int arr[], int sz)
{
int i = 0;
for (i = 0; i < sz; i++)
{
printf("%d ", arr[i]);
}
}
int main()
{
int arr[10] = { 0 };
int sz = sizeof(arr) / sizeof(arr[0]);
SR(arr, sz);
qsort(arr, sz, sizeof(int), P);
print_arr(arr, sz);
return 0;
}
二: 使⽤qsort排序结构数据:排序age
#include <stdio.h>
#include <string.h>
struct stu
{
int age;
char name[20];
};
int test(const void* p1, const void* p2)
{
return ((struct stu*)p1)->age-((struct stu*)p2)->age;
}
int main()
{
struct stu s[3] = { {19,"libai"},{18,"wangwei"},{20,"zhangsan"} };
int sz = sizeof(s) / sizeof(s[0]);
qsort(s, sz, sizeof(s[0]),test);
return 0;
}
三: 使⽤qsort排序结构数据:排序name
#include <stdio.h>
#include <string.h>
struct stu
{
int age;
char name[20];
};
int test(const void* p1, const void* p2)
{
return strcmp(((struct stu*)p1)->name,((struct stu*)p2)->name);
}
int main()
{
struct stu s[3] = { {19,"libai"},{18,"zangwei"},{20,"whangsan"} };
int sz = sizeof(s) / sizeof(s[0]);
qsort(s, sz, sizeof(s[0]),test);
return 0;
}
四: qsort函数的模拟实现
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int P(const void* p1, const void* p2)
{
return (*(int*)p1 - *(int*)p2);
}
void swap(char* buf1, char* buf2, size_t width)
{
int i = 0;
for (i = 0; i < width; i++)
{
char tamp = 0;
tamp = *buf1;
*buf1 = *buf2;
*buf2 = tamp;
buf1++;
buf2++;
}
}
void paixu(void* base, size_t sz, size_t width, int (*pa)(void* p1, void* p2))
{
int i = 0;
for (i = 0; i < sz - 1; i++)
{
int j = 0;
for (j = 0; j < sz - 1 - i; j++)
{
if (pa((char*)base + j * width, (char*)base + (j + 1) * width) > 0)
{
swap((char*)base + j * width, (char*)base + (j + 1) * width, width);
}
}
}
}
int main()
{
int arr[10] = { 10,9,8,7,6,5,4,3,2,1 };
int sz = sizeof(arr)/sizeof(int);
paixu(arr, sz, sizeof(int), P);
int n = 0;
for (n = 0; n < sz; n++)
{
printf("%d ", arr[n]);
}
return 0;
}