|
|
Reading Assignments and Suggested Exercises
| Book: | Introduction to The Design and Analysis of Algorithms, 1st edition | | Author: | Anany Levitin | | Chapter: | 6 |
| Section: 6.1 |
Presorting |
| Reading: | 193-197 |
| Exercises: | 1,2,3,5,7,10 |
| | Section: 6.3 |
Balanced Search Trees |
| Reading: | 209-217 |
| Exercises: | 1,2,4,8 |
| | Section: 6.4 |
Heaps and Heapsort |
| Reading: | 218-224 |
| Exercises: | 1,2,3,6,7,8,10 |
| | Section: 6.5 |
Horner's Rule and Binary Exponentiation |
| Reading: | 225-231 |
| Exercises: | 1,2,3,6,9,10 |
| | Section: 6.6 |
Problem Reduction |
| Reading: | 232-240 |
| Exercises: | 1,2,4,6,9,10 |
|
| See whole book
|
|
|