传统快排,一次把一个元素放到正确的位置,然后递归
#include <iostream>
#include <vector>
using namespace std;
int Partition(int a[], int l, int r)
{
int key = a[r];
while (l < r)
{
while (l < r && a[l] <= key)
{
l++;
}
a[r] = a[l];
while (l < r && a[r] >= key)
{
r--;
}
a[l] = a[r];
}
a[r] = key;
return r;
}
void quickSort(int a[], int l, int r)
{
if (l < r)
{
int index = Partition(a, l, r);
quickSort(a, l, index - 1);
quickSort(a, index + 1, r);
}
}
int main()
{
int a[9] = {57, 68, 59, 52, 72, 28, 96, 33, 24};
quickSort(a, 0, 8);
for (int i = 0; i < 9; i++)
{
cout << a[i] << ' ';
}
return 0;
}