【算法】快速排序--C++源代码（VS2015）

#include <iostream>
#include <vector>
using namespace std;


void QuickSort(vector<int> &vec, int left, int right)
{
if (left > right)
{
return;
}
int first = left;
int last = right;
int key = vec[first];
while (first < last)
{
while(first < last && vec[last] >= key)
{
last--;
}
vec[first] = vec[last];
while (first < last && vec[first] < key)
{
first++;
}
vec[last] = vec[first];
}
vec[first] = key;
QuickSort(vec, left, first - 1);
QuickSort(vec, first+1, right);
}


void Print(vector<int> &vec)
{
cout << "vec[] = ";
for (vector<int>::iterator iter = vec.begin(); iter != vec.end(); iter++)
{
cout << *iter << " ";
}
cout << endl;
}


int main()
{
int arr[] = { 2,4,6,8,10,1,3,5,7,9 };
vector<int> vec(&arr[0], &arr[10]);  // 将arr中的所有值赋值到vec中
QuickSort(vec, 0, vec.size() - 1);
Print(vec);


system("pause");
return 0;
}