This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (d) What is the average case number of comparisons? Problem 3. What can you conclude from Problems (1) and (2)? Problem 4. Assume you want to sort a list of n numbers that are in k groups, so that the smallest n/k are ±rst, then the next smallest n/k are second, etc. (a) Give a decision tree based lower bound on the time to produce a single sorted list. (You could base a lower bound on the fact that there really are k independent sorting problems. Do NOT use this lower bound argument.) (b) Give an algorithm for sorting this list. How fast is the algorithm? (This is an upper bound.) (c) Compare your lower and upper bounds....
View Full Document
This note was uploaded on 01/13/2012 for the course CMSC 351 taught by Professor Staff during the Fall '11 term at University of Louisville.
- Fall '11