问题:(结构体排序需要在监视窗口中才能查看)
1.swap返回值是int,导致输入结构体之后老是报错:冒泡排序函数重定义
2.冒泡函数没有调用cmp_int或者cmp_struct函数
3..冒泡函数if判断里,写成(char*)p1+j*length和(char*)p2+j*length
4.结构体初始化d后面没有加[],导致报错:数据类型过多
画图解释:
带解析版:
int int_cmp(const void* p1, const void* p2)
{
return (*(int*)p1 - *(int*)p2);
//p1 > p2:返回值 > 0
//p1 = p2:返回值 = 0
//p1 < p2 : 返回值 < 0
//(int*)p1:将p1强制转换成int * 类型
//* (int*)p1:解引用p1
}
void swap(char* p1,char* p2,int size)
{
int i = 0;
for ( i = 0; i < size; i++)
{
char temp = *p1;
*p1 = *p2;
*p2 = temp;
p1++;
p2++;
}
}
void bubble(int* base,int length, int size,int(*cmp)(void*,void*))
{
//void bubble:void原因是设计冒泡排序的程序员是无法预知未来要调用该函数是要排序什么类型的参数
//int* base:传指针。最好是void*
//int(*cmp)(void*,void*):cmp是函数指针名字,指向的函数是int_cmp
int i = 0;
int j = 0;
for ( i = 0; i < length-1; i++)
{
for (j = 0; j < length - i - 1; j++)
{
if (cmp((char*)base + j * size, (char*) base + (j + 1) * size) > 0)
{
//(char*)base:char:让每个元素进行比较(万一将来传的参数不是int而是char,这里用int会导致有四个字节的元素不能被比较)
//j * size,(j + 1) * size,跳过下一个字节
swap((char*)base + j * size, (char*)base + (j + 1) * size, size);
//size:要能看到比较的对数(有几对元素要进行比较)
}
}
}
}
#include<stdlib.h>
int main()
{
int arr[] = { 1,4,5,2,6,11,35,22,86,24,78,91,13 };
int length = sizeof(arr) / sizeof(arr[0]);
int i = 0;
bubble(arr, length, sizeof(int), int_cmp);
//arr:目标数组起始位置,length:数组长度,sizeof(int):数组中的元素大小,int_cmp:比较函数的函数名
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
return 0;
}
源代码:
#include<stdio.h>
struct Day
{
int id;
char weekday[20];
char weekend[20];
};
void swap(char* p1, char* p2, int size)
{
int i = 0;
for (i = 0; i < size; i++)
{
int temp = *p1;
*p1 = *p2;
*p2 = temp;
p1++;
p2++;
}
}
void maopaopaixu(void* base, int length, int size, int(*cmp)(void*, void*))
{
int i = 0;
int j = 0;
for (i = 0; i < length - 1; i++)
{
for (j = 0; j < length - 1 - i; j++)
{
if (cmp((char*)base + j * size, (char*)base + (j + 1) * size) > 0)
{
swap((char*)base + j * size, (char*)base + (j + 1) * size, size);
}
}
}
}
int cmp_struct(const void* p1, const void* p2)
{
return ((struct Day*)p1)->id - ((struct Day*)p2)->id;
}
void jiegouti()
{
struct Day d[] = {{6,"mon","five"},{2,"tue","two"},{3,"wed","three"}};
int length = sizeof(d) / sizeof(d[0]);
maopaopaixu(d, length, sizeof(d[0]), cmp_struct);
}
int cmp_int(const void* p1, const void* p2)
{
return *(int*)p1 - *(int*)p2;
}
void shuzu()
{
int arr[] = { 1,2,3,77,4,24,33,17,85,35 };
int length = sizeof(arr) / sizeof(arr[0]);
maopaopaixu(arr, length, sizeof(int), cmp_int);
int i = 0;
for ( i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
}
int main()
{
shuzu();
jiegouti();
return 0;
}