c++实现对输入数组进行快速排序的示例(推荐)

 #include "stdafx.h" #include  #include  #include  using namespace std; void quickSort(vector &a, int, int); void swap(int &a, int&b); vector split(string s, string seperator); int main() { string str; cout << "please input your array: " << endl; getline(cin, str); vector strs = split(str, " "); cout << "The original array is " << endl; for (unsigned int i = 0; i  array(strs.size()); for (unsigned int i = 0; i  &a, int start, int base) { if (start >= base) { return; } int i = start, j = start; int temp = a[base]; for (;j a[base]) { swap(a[i], a[base]); } quickSort(a, start, i - 1); quickSort(a, i + 1, base); } void swap(int &a, int&b) { if (a == b) { } else { a = a + b; b = a - b; a = a - b; } } vector split(string s, const string pattern) { string::size_type pos; vector result; s += pattern; unsigned int size = s.size(); for (unsigned int i = 0; i