/* C++, STL sort, C arrays */
#include <time.h>
#include <stdlib.h>

#include <iostream.h>
#include <algo.h>

typedef TYPE T;

void test(int N)
{
  if(N < 1)
  {
    cerr << "Input value " << N << " too small." << endl;
    return;
  }

  T* data = new T[N];
  if(!data)
  {
    cerr << "Could not allocate data - " << N*sizeof(T) << " bytes." << endl;
    return;
  }
  for(int i=0; i<N; ++i)
    data[i] = rand();

  time_t begin = clock();
  sort(data, data+N);
  time_t end = clock();
  double time_elapsed = double(end-begin)/CLOCKS_PER_SEC;

  cout << time_elapsed << endl;
  delete[] data;
}

int main(int argc, char* argv[])
{
  if(argc != 2)
    cerr << "Usage: " << argv[0] << "<array-size>" << endl;
  else
  {
    for(int i=0; i<10; ++i)
      test(atoi(argv[1]));
  }
  return 0;
}