// generic bubble sort in C++
// STL / object version Jan 00 by Amit Patel
// alek: added timing code

#include <stdio.h> //timing
#include <time.h>

#include <iostream>
#include <vector>

using namespace std;

template<class Iter, class Comparator>
void mysort(Iter a, Iter b, Comparator cmp) {
  for(Iter i=a; i+1 != b; ++i)
    for(Iter j=b-1; j!=i; --j)
      if(!cmp(*(j-1), *j)) swap(*(j-1), *j);
}

struct Range {
  int lb, ub;
  Range() {}
  Range(int l, int u): lb(l), ub(u) {}
};

ostream& operator << (ostream& out, const Range& r) {
  return out << '[' << r.lb << ',' << r.ub << ']';
}

struct LBComparator {
  bool operator() (const Range& a, const Range& b) const {
    return a.lb < b.lb;
  }
};

struct UBComparator {
  bool operator() (const Range& a, const Range& b) const {
    return a.ub < b.ub;
  }
};

int main() {
  time_t stime, etime;  //timing
  char timebuf[128];

  const int REPEAT = 10;

  const int N = 10000;
  vector<Range> a(N);

  for(int i=0; i<N; i++) {
    a[i] = Range(i*7%1000, i*13%1000);
  }

  //cout << "sorting...\n";  cout.flush();
  printf( "sorting N=%d REPEAT=%d\n", N, REPEAT);

  _tzset(); //timing
  _strtime( timebuf );
  printf( "started at: %s\n", timebuf );
  time( &stime );

  for(int count = 0; count < REPEAT; ++count) {
    mysort(a.begin(), a.end(), LBComparator());
    mysort(a.begin(), a.end(), UBComparator());
  }

  time( &etime ); //timing
  _strtime( timebuf );
  printf( "finished at: %s in %g sec\n", timebuf, difftime(etime, stime) );
  //cout << "done.\n";  cout.flush();
  return 0;
}