quickSort算法导论版实现

本文主要实践一下算法导论上的快排算法，活动活动。

伪代码图来源于 http://www.cnblogs.com/dongkuo/p/4827281.html

 // imp the quicksort algorithm 2016.12.21

 #include <iostream>
 #include <fstream>
 #include <vector>

 using namespace std;

 int Partion(vector<int> & vec, int b, int e)
 {
     int x = vec[e];
     int i = b - ;

     for(int j = b;j < e;j++)
         if (vec[j] < x)
         {
             i += ;
             swap(vec[i], vec[j]);
         }

     swap(vec[i + ], vec[e]);

     return i + ;
 }

 void quickSort(vector<int> & vec,int b,int e)
 {
     int q = ;
     if (b < e)
     {
         q = Partion(vec, b, e);
         quickSort(vec, b, q - );
         quickSort(vec, q + , e);
     }
 }

 int main()
 {
     ifstream fin("rawData.txt");
     ofstream fout("sortedData.txt",ios::out);

     int temp;
     vector<int> vec;

     while (fin >> temp) {
         vec.push_back(temp);
     }

     fout << "Data before sort :" << endl;
     for each (auto & var in vec)
     {
         fout << var << " ";
     }
     fout << endl;

     quickSort(vec,,vec.size() - );

     fout << "Data after sort :" << endl;
     for each (auto & var in vec)
     {
        // cout << var << " ";
         fout << var << " ";
     }
     fout << endl;

     fin.close();
     fout.close();

     return ;
 }

原始数据位于rawData.txt中如下：

3 2 10 8 6 7 1

运行结果保存在sortedData.txt中如下：

Data before sort :
3 2 10 8 6 7 1
Data after sort :
1 2 3 6 7 8 10