This preview shows page 1. Sign up to view the full content.
Unformatted text preview: order: 1,2,5,6, 8. 1 2 3 4 5 6 7 8 9 3. Run QuickSelect to find the 3 rd smallest number in the following list: 6 2 8 9 4 1 10 How many times does partition get called? 4. What is the run time of Merge Sort? 5. What is the Best case run time of Quick Select? 6. What is the worst case run time for Quick Select? 7. Run heapify on the following list of numbers: 6, 2, 1, 5, 7, 3, 8, 4 8. Perform remove min on the previously constructed tree from #7. 9. Perform insert 1 into the resulting heap after #8....
View Full
Document
 Spring '09
 Guha
 Computer Science, Algorithms, Insertion Sort

Click to edit the document details