CS 241 Data Structures- Lab 6, Due 3/9
Sort Timing
Implement radix sort, and table (counting) sort, and time them on various sized lists,
namely 1000, 2000, 4000, 8000, etc
(by passing them to a SortTimer) to verify they are actually O(nlogn).
Approach
Work in pairs!
Add a feature so that any sort which takes more than 30 seconds on n does not run for n*2 and etc, but rather immediately prints "slow!"
(hint: add a boolean tooSlow=false; to AbstractSort, switch it when the time is too big, and don't run if it is true).
Demo your code during lab for credit.