Unformatted text preview: to solve this problem. 2. Show that the median of ﬁve numbers can be found by making six comparisons. 3. In the class, we solved the Selection Problem with an algorithm that is linear-time in the worst case by dividing the array into groups of size 5. Actually, if m is the group size, any odd values of m ≥ 5 yields a linear-time complexity. But this is not true when m < 5. Deﬁne the recurrence T ( n ) of m = 3 and prove by induction that this recurrence is in Ω( n lg n ). 1...
View Full Document
- Spring '08
- Algorithms, Computational complexity theory