.Open CSci202 Laboratory 08 Timing Sorting Algorithms
.Open Purpose
 Experiment with sorting data by using well known algorithms and data structures.
 Learn more about vectors, lists, multisets, and priority queues.
 Learn a little about the <ctime> library.
.See http://www.cplusplus.com/reference/clibrary/ctime/
.Close
. Givens
The following programs all create a vector of integers and sort them.
They repeat this 100 times (constant `Sample`) and calculates the average time.
.See http://www/dick/cs202/timeBubbleSort.cpp
.See http://www/dick/cs202/timeListSort.cpp
.See http://www/dick/cs202/timeMultisetSort.cpp
.See http://www/dick/cs202/timePriorityQueueSort.cpp
.See http://www/dick/cs202/timeSelectionSort2.cpp
.See http://www/dick/cs202/timeVectorSort.cpp
(in alphabetical order).

Each has something deleted marked like this /******/
. Goals
To put up on the board a table and a graph of times for
different ammounts of data for different sorts.
.Open Process
 Choose one of the above algorithms to experiment with.
 Download it, compile it, fix it,and run the result.
 Note down the output: algorithm, size of data, and mean time.
 Experiment with at least 4 other `Sizes`.  Don't forget to note the results on paper.
 Transfer your results on the white board.
 Repeat with a different program....

  The teacher will start plotting points and drawing graphs the data comes in...
.Close Process
. Note -- Quiz 4 and the final may test your knowledge of these programs
.Close CSci202 Laboratory 08 Timing Sorting Algorithms