For this lab, I want you to take the four sort functions that we looked
at in class.  You can find them in the link to programs.  YOu will also 
find there a file containing 2,000,000 random doubles.

I would like you to modify the four sorts, bubble, merge, quick, and heap, 
to use doubles rather than ints.  I have included four global variables 
to count, for each sort, how many comparisons it did in the process of running.

Take this code and write a driver program to call each sort with
50 items. Do this, say, 100 times and get the average number of 
compares for each of the four sorts. Save these four averages.

Then do the same thing with 100 items.  Then 150 items. then 200 items
Then 250 items, and so on up to, say, 500 items. 

Output the data to a file, and prepare graphs of "number of comparisons"
as a function of the data set size.

You will not be able to use the same scale to present the bubble sort
data as the other data, as it will grow too fast.

If you want to do it particularly nicely, read your data file into 
an excel spreadsheet and  use the graphing functions of excel to make your
plots.