C語言快速排序函數(shù)用法（qsort）

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct student
{
  int id;
  char name[12];
  char sex;
};
int compare(const void* a,const void* b)//基本數(shù)據(jù)類型排序
{
  return *(char*)a-*(char*)b;//從小到大
    //取值//強(qiáng)轉(zhuǎn)為相應(yīng)類型的指針?。?}
int compare_struct(const void* a,const void* b)
{
  return (*(struct student*)a).id-((struct student*)b)->id;
         //注意優(yōu)先級(jí)誒！//否則報(bào)錯(cuò)在非結(jié)構(gòu)體中。。。
}
int compare_struct_duoji(const void* a,const void* b)//多級(jí)排序
{
  struct student student_a=*(struct student*)a;
  struct student student_b=*(struct student*)b;

  if(student_a.id==student_b.id)
  {
    return student_a.sex-student_b.sex;
  }
  else
  {
    return student_a.id-student_b.id;
  }
}
void main()
{
//*************char型*************
  char a[5]="hello";
  qsort(a,5,sizeof(a[0]),compare);
      //元素個(gè)數(shù)//元素大小//函數(shù)指針
  int i;
  for(i=0;i<5;i++)
      printf("%c ",a[i]);
  printf("\n");

//************struct型************
  struct student e[4]={{100,"chen",'m'},{100,"li",'f'}, \
             {70,"wang",'f'},{100,"zhang",'m'}};
  qsort(e,4,sizeof(e[1]),compare_struct_duoji);

  for(i=0;i<4;i++)
      printf("%d %s %c\n",e[i].id,e[i].name,e[i].sex);
}