快速排序代码

快速排序代码，同上一篇堆排序，更喜欢简洁代码，适合IT公司笔试面试用。

int partition(int a[], int low, int high){
	int key = a[low];	
	while(low < high){
		while( low < high && key <= a[high] )
			high--;
		a[low] = a[high];
		while( low < high && key >= a[low] )
			low++;
		a[high] = a[low];
	}
	a[low] = key;
	return low;
}
void quickSort(int a[], int low, int high){
	if(low < high){
		int privotLoc = partition(a,  low,  high);
		quickSort( a, low, privotLoc-1);
		quickSort( a, privotLoc+1, high);
	}
}