404_HW7_F11 - UML CS Analysis of Algorithms 91.404 (section...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Analysis of Algorithms 91.404 (section 201) Fall, 2011 Page 1 of 2 Homework Set #7 Assigned: Wednesday, 10/31 Due: Monday, 11/7 (start of lecture) This assignment covers textbook material in Chapter 8. Note: Partial credit for wrong answers is only given if work is shown. 1. (5 points) Decision Trees for Comparison-Based Sort : Textbook Exercise 8.1-1 on p. 193. 2 . (15 points) Radix Sort: Using Figure 8.3 on p. 198 as a model, illustrate the operation of RADIX-SORT on the following list of English words: LOG, DOG, BOG, BAG, CAT, ART. 3 . (25 points) Bucket Sort : Textbook Exercise 8.4-2 on p. 204. For your change to the algorithm, include in your answer: - pseudocode for the revised algorithm, indicating where you made your change(s); - average and worst-case running time analyses; - correctness justification. 4. (25 points) Counting Sort : The COUNTING-SORT implementation in the textbook on p. 195 contains a for loop header in line 10 that counts down from A.length to 1. Design a variation
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

404_HW7_F11 - UML CS Analysis of Algorithms 91.404 (section...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online