quicksort.cpp

《数据结构、算法与应用》从C++语言应用角度列举了要点

// test quick sort

#include <iostream>
#include <algorithm> // has copy
#include "quickSort.h"

using namespace std;


int main()
{
   int a[10] = {10,7,8,9,4, 2, 3, 6, 5,1};

   // output the elements
   cout << "a[0:9] = ";
   copy(a, a+10, ostream_iterator<int>(cout, " "));
   cout << endl;

   // sort
   quickSort(a,10);

   // output the sorted sequence
   cout << "After the sort, a[0:9] = ";
   copy(a, a+10, ostream_iterator<int>(cout, " "));
   cout << endl;
   return 0;
}