test_quick_sort.cpp

Go to the documentation of this file.

#include <deque>
#include <iostream>
#include <iterator>
#include <stdlib.h>

#include "stable_quick_sort.h"

using namespace std;

int main() {
  deque<int> data, sorted_data;
  int i, j;

  for (i=0; i<20; ++i) {
    j = rand() % 10;
    data.push_back( j);
  }

  stable_quick_sort<int, deque<int> >( data, sorted_data);

  copy( sorted_data.begin(), sorted_data.end(), ostream_iterator<int>( cout, " "));

  return 0;
}

---