C++ 快排怎么做

C++ 快排怎么做

int partition(int a[], int left, int right, int pivotIndex)
{
int pivot = a[pivotIndex];
do
{
while (a[left] < pivot) left++;
while (a[right] > pivot) right--;
if (left < right && a[left] != a[right])
{
swap(a[left], a[right]);
}
else
{
return right;
}
}
while (left < right);
return right;
}
void quicksort(int a[], int left, int right)
{
if (left < right)
{
int pivot = (left + right) / 2; // middleint pivotNew = partition(a, left, right, pivot);
quicksort(a, left, pivotNew - 1);
quicksort(a, pivotNew + 1, right);
}
}

看数据结构书籍或者网上下载代码