CS 241 Data Structures- Lab 6, Due 4/6

Sort Timing

  1. Modify my O(n^2) RadixSort so that it is actually O(n); download TimingBase_April.zip from examplesFrom....
  2. Implement and time HeapSort (see lecture notes for details)

Approach

Work in pairs! Two heads are... um... more than one.
Demo your code during lab for credit.