A race to see which is faster: Merge-sort or Quick-sort.

Implement both merge-sort and quick-sort on a large array of strings.
Make your program generate a large array of random strings (size specified by the user).
Make a copy of that array.
Time merge-sort sorting one array, and quick-sort srting the other.
Gather statistics over a range of sizes to determine which is generally fastest.


This function is good on rabbit.

#include <time.h>
#include <sys/resource.h>

double get_cpu_time()
{ struct rusage ruse;
  getrusage(RUSAGE_SELF, &ruse);
  return ruse.ru_utime.tv_sec+ruse.ru_utime.tv_usec/1000000.0 + 
         ruse.ru_stime.tv_sec+ruse.ru_stime.tv_usec/1000000.0; }