C語言版快速排序

分治法進行排序：(線性遞歸) 

#include<stdio.h>
 
int PviottTops(int a[],int low,int high){
	int pviot=a[low];
	while(low<high){
		while(low<high && a[high]>=pviot) --high;
		a[low]=a[high];
		while(low<high && a[low]<=pviot) ++low;
		a[high]=a[low];
	}
	a[low]=pviot;
	return low;
}
 
void Quick_Sort(int a[],int low,int high){
	if(low<high){
		int pviot=PviottTops(a,low,high);
		Quick_Sort(a,low,pviot-1);
		Quick_Sort(a,pviot+1,high);
	}
	
}
int main(){
	int a[]={1,5,3,2,6,8,7,9,0};
	int len=sizeof(a)/sizeof(int);
	Quick_Sort(a,0,len-1);
	for(int i=0;i<len;i++){
		printf("%d ",a[i]);
	}
	return 0;
}

尾遞歸：（減少棧空間）

#include<stdio.h>
 
int PviottTops(int a[],int low,int high){
	int pviot=a[low];
	while(low<high){
		while(low<high && a[high]>=pviot) --high;
		a[low]=a[high];
		while(low<high && a[low]<=pviot) ++low;
		a[high]=a[low];
	}
	a[low]=pviot;
	return low;
}
 
void Quick_Sort(int a[],int low,int high){
	while(low<high){
		int pviot=PviottTops(a,low,high);
		Quick_Sort(a,low,pviot-1);
		low=pviot+1;
	}
	
}
int main(){
	int a[]={1,5,3,2,6,4,7,9,0};
	int len=sizeof(a)/sizeof(int);
	Quick_Sort(a,0,len-1);
	for(int i=0;i<len;i++){
		printf("%d ",a[i]);
	}
	return 0;
}