sort.cc

#include <algorithm>
#include <vector>
#include <parallel/algorithm>

using namespace std;

extern "C" int cmp(const void* a, const void* b)
{
  return *(int*)a < *(int*)b;
}

int main(int argc, char**argv)
{
  auto lim = atoi(argv[1]);
  vector<int> blah;
  blah.reserve(lim);
  for(int n=0 ; n < lim; ++n)
    blah.push_back(random());

  if(*argv[2]=='q')
    qsort(&blah[0], blah.size(), sizeof(int), cmp);
  else if(*argv[2]=='p')
    __gnu_parallel::sort(blah.begin(), blah.end());
  else if(*argv[2]=='s')
    sort(blah.begin(), blah.end());
}