算法：快速排序，C++版，方便复习

摘抄自《算法图解》中代码。

#include <iostream>
#include <vector>

using std::cout;
using std::endl;

template <typename T>
std::vector<T> quicksort(const std::vector<T>& arr) {
	//基线条件，0或1，不用排序
	if (arr.size() < 2)
		return arr;

	// recursive case
	const T* pivot = &arr.front() + arr.size() / 2 - 1; // 设置一个值为基准值
	std::vector<T> less;  // vector to store all the elements less than the pivot
	std::vector<T> greater;  // vector to store all the elements greater than the pivot

	for (const T* item = &arr.front(); item <= &arr.back(); item++) {
		if (item == pivot) continue; // skip pivot element
		if (*item <= *pivot) less.push_back(*item);
		else greater.push_back(*item);
	}

	std::vector<T> sorted_less = quicksort(less);
	std::vector<T> sorted_greater = quicksort(greater);
	// concatenate less part, pivot and greater part
	sorted_less.push_back(*pivot);
	sorted_less.insert(sorted_less.end(), sorted_greater.begin(), sorted_greater.end());

	return sorted_less;
}

int main() {
	std::vector<int> arr = { 5,4,7,1,2,9,3};
	std::vector<int> sorted = quicksort(arr);
	for (int num : sorted) {
		cout << num << " ";
	}
	cout << endl;
}