快速排序c++高效版本

void swap(int k[],int low,int high)
{
int temp;
temp = k[low];
k[low]=k[high];
k[high] = temp;
}


int Partition(int k[],int low,int high)
{
int point;


/*
*eg1:优化基准点,随机三点取中间值
*/
/*
int mid = low + (high-low)/2;
if(k[low]>k[high])
{
swap[k,low,high];
}
if(k[mid]>k[high])
{
swap(k,mid,high);
}
if(k[mid]>k[low])
{
swap(k,mid,low);
}
*/


/*
*eg：减少不必要的交换
*/
point = k[low];
while(low < high)
{
while( low<high && k[high]>=point) 
{
high--;
}
//swap(k,low,high);
k[low]=k[high];


while( low<high && k[low]<=point)
{
low++;
}
//swap(k,low,high);
k[high]=k[low];
}
k[low]=point;
return low;
}
void QSort(int k[],int low,int high)
{
/**
*伪递归
*/
int point;
/*
if(low < high)
{
point = Partition(k,low,high);
QSort(k,low,point-1);
QSort(k,point+1,high);
}
*/
while(low <high )
{
point = Partition(k,low,high);


if( point-low < high -point)
QSort(k,low,point-1);
low = point + 1;
}
else
{
QSort(k,point+1,high);
high = point -1;
}
}
}
void QuickSort(int k[],n)
{
QSort(k,0,n-1);
}


int main(int argc,char* argv)
{
int arr[]={1,2,5,4,3,2,1};
QuickSort(arr,sizeof(arr)/sizeof(arr[0]));
return 0;
}