Unformatted text preview: 2. At least one worked example or diagram to show more precisely how your algorithm works. 3. A proof (or indication) of the correctness of the algorithm. 4. An analysis of the running time of the algorithm. Remember, your goal is to communicate. Graders will be instructed to take off points for convo-luted and obtuse descriptions. Exercise 10-1. Do exercise 26.1-5 on page 650 of CLRS. Exercise 10-2. Do exercise 26.1-9 on page 650 of CLRS. Exercise 10-3. Do exercise 26.2-3 on page 663 of CLRS. Exercise 10-4. Do exercise 26.2-5 on page 663 of CLRS. Exercise 10-5. Do exercise 26.2-8 on page 664 of CLRS....
View Full Document
- Fall '04
- Algorithms, CLRS, Introduction to Algorithms, Charles E. Leiserson, Professors Erik Demaine