常见排序算法之快速排序的C++实现
#include<iostream>
#include<vector>
#include<time.h>
using namespace std;
class Solution
{
public:
void quickSort(vector<int>& v, int left, int right)
{
if (left >= right)
return;
int cur = partition(v, left, right);
quickSort(v, left, cur - 1);
quickSort(v, cur + 1, right);
}
int partition(vector<int>& v, int left, int right)
{
int i = left;
int j = right;
while (i < j)
{
while (i < j && v[j] >= v[left])
--j;
while (i < j && v[i] <= v[left])
++i;
swap(v[i], v[j]);
}
swap(v[i], v[left]);
return i;
}
};
int main()
{
srand((unsigned)time(NULL));
Solution so;
vector<int> v = { 10, 2, 9, 1, 7, 0, 4, 3, 5, 8, 6 };
for (int x : v)
cout << x << " ";
cout << endl;
so.quickSort(v, 0, v.size() - 1);
for (int x : v)
cout << x << " ";
return 0;
}