学步园

快速排序，递归实现：

#include <stdio.h><br /> #define MAXNUM 100</p> <p>typedef int elemtype;</p> <p>int partition(elemtype*,int,int);<br /> void QuickSort(elemtype*,int,int);</p> <p>void main(){<br /> int count,i=0;<br /> elemtype array[MAXNUM+1];<br /> puts("the count of the number:");<br /> scanf("%d",&count);<br /> puts("the numbers:");<br /> while(count--) scanf("%d",&array[++i]); //0号不使用<br /> QuickSort(array,1,i);<br /> for(count=1;count<=i;count++) printf("%d ",array[count]);<br /> }</p> <p>void QuickSort(elemtype array[],int low,int high){ //快排主函数，递归<br /> int pivot; //中枢<br /> if(low<high){<br /> pivot=partition(array,low,high);<br /> QuickSort(array,low,pivot-1);<br /> QuickSort(array,pivot+1,high);<br /> }//if<br /> }//QuickSort</p> <p>int partition(elemtype array[],int low,int high){ //进行一次快排<br /> array[0]=array[low]; //暂存,且将之用作中枢<br /> while(low<high){<br /> while(low<high&&array[high]>=array[0]) high--;<br /> array[low]=array[high];<br /> while(low<high&&array[low]<array[0]) low++;<br /> array[high]=array[low];<br /> }//while<br /> array[low]=array[0];<br /> return low;<br /> }