Read in a group of Animals from a file (maximum 500,000,000 or five
hundred million). Animal is a simple class. One animal is greater than
another if it has more weight.


Once this group has been read, check to see if it is sorted.
How much time did this take?

Sort the data using one of three algorithms as determined by a flag on
the command line. Either, use the qsort from cstdlib, another sort of
your chosing that you have implemented (that is not heap-sort) or use
your own hand-written heap-sort based on this command line flag. Write
this code from scratch and do not visit outside sources other than
your book. Failure to comply to this will be a violation of honor
code.  How much time does it take for the sort to run?

Compare the timed results of qsort, your choice for sort and your heap
sort algorithm. Discuss these timed results in a readme.

Remember for EC, organize a competition where the fastest heap sorting
algorithm wins.