排序——快速排序

#include<stdio.h>
void QuickSort(int R[],int low,int high){
int temp;
int i=low,j=high;
if(low<high){
temp=R[low];
while(i<j){
while(j>i&&R[j]>=temp)–j;
if(i<j){
R[i]=R[j];
++i;
}
while(i<j&&R[i]<temp)++i;
if(i<j){

			R[j]=R[i];
			--j;
		}
	}
	R[i]=temp;
	QuickSort(R,low,i-1);
	QuickSort(R,i+1,high);
}

}
int main(){
int R[5]={11,22,7,3,9};
int i;
QuickSort(R,0,4);
for(i=0;i<5;i++){
printf("%d ",R[i]);
}
return 0;
}