快速排序（Quick Sort）的C语言实现

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 #define MAXSIZE 6
 4 #define OK 1
 5 #define ERROR 0
 6 
 7 typedef int Status;
 8 typedef int KeyType;
 9 typedef char InfoType;//要malloc() 
10 
11 typedef struct{
12     KeyType score;
13     InfoType name[20]; 
14 }RedType;//记录类型  
15 
16 typedef struct{
17     RedType r[MAXSIZE+1];
18     int length;
19 }SqList;
20 /*
21     Name: 初始化
22     Copyright: 
23     Author: leo 
24     Date: 10-12-15 16:54
25     Description: 初始化顺序表 
26 */
27 
28 Status initSqList(SqList &l){
29     l.length=MAXSIZE;
30     printf("%d",l.length);
31     for(int i=1;i<=l.length;i++){
32         printf("请输入第%d个同学的名字和分数",i);
33         gets(l.r[i].name);
34         scanf("%d",&(l.r[i].score));
35         getchar();
36         printf("\n");
37     }
38     
39     return OK;
40 }
41 /*
42     Name: 部分排序 
43     Copyright: http://www.cnblogs.com/gangtiexia
44     Author: 钢铁侠
45     Date: 10-12-15 17:00
46     Description: 反复按照枢轴进行快速排序：将比枢轴大的放在一边，比枢轴小的放在另一边 
47 */
48 
49 int partition(SqList &l,int low,int high){
50     l.r[0]=l.r[low];//枢轴 
51     while(low<high){
52         while(low<high&&l.r[high].score>l.r[0].score) high--;
53         l.r[low]=l.r[high];
54         while(low<high&&l.r[low].score<l.r[0].score) {
55         printf("\nhigh为%d\n",high);
56         low++;}
57         l.r[high]=l.r[low];
58     }
59     l.r[low]=l.r[0];
60     return low;
61 }
62 
63 /*
64     Name: 启动递归快速排序
65     Copyright: http://www.cnblogs.com/gangtiexia
66     Author: 钢铁侠
67     Date: 11-12-15 14:37
68     Description: 启动递归快速排序，并进行第一个大部分（所有记录）的快速排序 
69 */
70 
71 Status QuickSort(SqList &l,int low,int high){
72     int pivotloc;
73     if(low<high){
74         pivotloc=partition(l,low,high);
75         QuickSort(l,low,pivotloc-1);
76         QuickSort(l,pivotloc+1,high);
77     } 
78     return OK;
79 }
80 
81 Status Traverse(SqList &l){
82     for(int i=1;i<=MAXSIZE;i++)
83     {
84         printf("%s的分数为%d \n",l.r[i].name,l.r[i].score); 
85     }
86 } 
87 
88 int main(){
89     
90     SqList L;
91     initSqList(L);
92     printf("L.length为%d",L.length);
93     QuickSort(L,1,L.length); 
94     Traverse(L);
95     return 0;
96 }