快速排序

int  QuickPartion(int *arr, int low, int high)
{
int pivotKey = arr[low];
while (low < high)
{
while (low<high&&arr[high]>pivotKey)
high--;
swap(arr[low], arr[high]);
while (low < high&&arr[low] < pivotKey)
low++;
swap(arr[low], arr[high]);

}
return low;
return 0;
}
void Qsort(int *arr, int  low, int high)
{

if (low<high)
{
int key = QuickPartion(arr, low, high);
Qsort(arr, low, key-1);
Qsort(arr, key+1, high);
}
}

void QuickSort(int *arr, int length)
{
Qsort(arr, 1, length);
}