代码如下:
/*
* quickSort.c
*
* Created on: 2012-4-9
* Author: LW
*/
#include
#include
typedef struct _student
{
int id;
char name[30];
}student,*pStudent;
student students[20] =
{
{13,"狐狸金"},{15,"杜十娘"},{8,"葫芦娃"},{4,"喜羊羊"},
{14,"叮当猫"},{18,"孙悟空"},{3,"格列佛"},{6,"咖啡猫"},
{19,"猪八戒"},{11,"程序员"},{5,"鲁滨逊"},{9,"金枪鱼"},
{10,"马大哈"},{12,"周星星"},{1,"灰太狼"},{2,"唐老鸭"},
{20,"子虚君"},{16,"乌有君"},{7,"小二郎"},{17,"贾宝玉"},
};
//students[]是需要进行排序的数组，length是students数组的元素个数
void quickSort(student students[],int length)
{
int i,j,flag = students[0].id;
student stutemp;
int t;
if(length>1)
{
for(t=0;t