毕业一年多后在写快速排序

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55

#include <iostream> #include <vector> #include <algorithm> using namespace std;   void print(int elem) {     cout<<elem<<" "; }   void quicksort(vector<int> &vec, int left, int right) {         if(left < right)         {             int key = vec[left];             int low = left;             int high = right;             while(low < high)             {                 while(low < high && vec[high] > key)                 {                     high--;                 }                 vec[low] = vec[high];                   while(low < high && vec[low] < key)                 {                     low++;                 }                 vec[high] = vec[low];             }             vec[low] = key;             quicksort(vec, left, low-1);             quicksort(vec, low+1, right);         }     }     int main() {     int arr[10] = {10,8,2,3,5,7,6,9,4,1};     vector<int> vec(arr, arr+10);     cout<<"before quicksort:";     for_each(vec.begin(), vec.end(), print);     cout<<endl;     int left = 0;     int right = vec.size();     quicksort(vec, left, right);     cout<<"after quicksort:";     for_each(vec.begin(), vec.end(), print);     cout<<endl;     return 0; }