The code for make-random-list is now in sortcode.scm.
You will have to write make-sorted-list, and generate-sorted-lists,
like generate-random-lists. These will be marked so hand in listings.
You don't have to experiment to find a good maximum length for
insertion sorting; 600 is a good length. The experiments on the
sorted lists may take up to 5 minutes for that length.
To do the graphing, use graph-it.scm and graph-meter.scm. Remember to
load draw.scm.
There are several magic numbers in graph-it.scm. It produces results
but the scaling may be off. I have not tested these numbers visually
yet.
(graph lengths results) is what you should use.
The lab mentions scaling of the y-axis in the graphs. If you want to explore
this you can, but it's not necessary.
IMPORTANT:
For every graph, write down and hand in a formula in big-oh notation that
best describes the time complexity in number of comparisons of the algorithm
on the type of input.
---
for mystery:
plot the number of conses as a function of n, for n from 10 to 200.