This preview shows page 1. Sign up to view the full content.
Unformatted text preview: clearer. Is the modifed algorithm Faster than ( N logN )? Why or why not? 3. Do problem 7.31 From the text For insertion sort, bubble sort, mergesort, and quicksort. IF there is an obvious and easy way to make the sort stable, assume that it is part oF the algorithm and state what it is. 4. Consider problem 7.38 From the text. (a) Give a clearly O ( N ) algorithm For fnding the median. (b) Now give an algorithm that is O ( logN ), as asked in the text. Be sure to include an argument For why your algorithm is O ( logN ). With 3 days to go, the 331 sta consider this part to be challenging. Enjoy it, but do not burn hours on it. 5. Give a Formal argument, based on the defnition oF Big Theta, proving that f ( N ) = 3 N 27 N + 5 is ( N 2 ). 1...
View Full
Document
 Spring '08
 M.McCullen
 Algorithms, Data Structures

Click to edit the document details