void SwapVar(int *a,int i,int j)
{
int temp;
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
//快速排序 递归调用
void QuickSort(int *arr,int left,int right)
{
int last;
if (left>=right) {
return;
}
int rand = (left+right)/2;
SwapVar(arr, left, rand);
last = left;
for (int i=left; i<right; i++) {
if (arr[i]<arr[left]) {
SwapVar(arr, ++last, i);
}
}
SwapVar(arr, left, last);
QuickSort(arr, left, last-1);
QuickSort(arr, last+1, right);
}