These files
     /home/118/people1.txt
     /home/118/people2.txt
     /home/118/people3.txt
     /home/118/people5.txt
     /home/118/people10.txt
     /home/118/people20.txt
     /home/118/people30.txt
     /home/118/people50.txt
     /home/118/people100.txt

contain social security number, date of birth, first name, last name, zip code
for a large number of imaginary people.

Implement quicksort, and use it in a program that can sort any one of these files
quickly, in ascending order of first name and last name.

Demonstrate by experiment that your quicksort is faster than quadratic.

This is the special timing function for use 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; }