该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
#include
#include
struct cmp
{
char name[20];
int age;
double count;
};
double comp
(cmp a,cmp b)
{
if(strcmp(a.name,b.name)!=0)
return strcmp(a.name,b.name);
else if(a.age !=b.age)
return a.age-b.age;
else if(a.count!=b.count)
return a.count-b.count;
}
int partition(void *a,int low,int high,double(*comp)(cmp a,cmp b))
{
cmp key;
key=a[low];
while(low
{while(low=0)
--high;
a[low]=a[high];
while(low
++low;
a[high]=a[low];
}
a[low]=key;
return low;
}
void qsot(void *a,int low,int high,double(*comp)(cmp a,cmp b))
{
int pivotloc;
if(low
{
pivotloc=partition(a,low,high,comp);
qsot(a,low,pivotloc-1,comp);
qsot(a,pivotloc+1,high,comp);
}
}
int main()
{
int i;
cmp a[3]={"xiaoming",18,77,"xiaohong",19,60,"xiaofang",16,80};
qsot(a,0,2,comp);
for(i=0;i<3;i++)
{
printf("%s\n%d\n%f\n",a[i].name,a[i].age,a[i].count);
}
return 0;
}