FYI, the average score on the final exam was 98.0/120 (=81.66%) with a standard deviation of 11.0.
The Quiz 1 crib sheet will be provided.
If you were given a sorted set, then you can find the k-quantiles just by looking at the numbers in the n/k, 2n/k, 3n/k, ... positions of the sorted array. Then you have a O(k) time algorithm.
For an unsorted set, you can run Select() k times on the original array. This takes O(n) time per call, resulting in a O(nk) time algorithm. The question is asking you to reduce this running time to O(n lg k).
Wednesdays 4:00pm – 6:00pm in ITE 334.The contacts page has been updated.