|
|
Reading Assignments and Suggested Exercises
| Book: | Introduction to The Design and Analysis of Algorithms, 1st edition | | Author: | Anany Levitin | | Chapter: | 2 |
| Section: 2.1 |
Analysis Framework |
| Reading: | 41-50 |
| Exercises: | 1,4,8,9,10 |
| | Section: 2.2 |
Asymptotic Notation and Basic Efficiency Classes |
| Reading: | 52-59 |
| Exercises: | 2,3,4,5,6,10 |
| | Section: 2.3 |
Mathematical Analysis of Nonrecursive Algorithms |
| Reading: | 61-67 |
| Exercises: | 1,2,4,6,7,9,10 |
| | Section: 2.4 |
Mathematical Analysis of Recursive Algorithms |
| Reading: | 69-76 |
| Exercises: | 1,2,4,5,7,10 |
| | Section: 2.5 |
Example: Fibonacci Numbers |
| Reading: | 78-83 |
| Exercises: | 4,6,9,10 |
| | Section: 2.6 |
Empirical Analysis of Algorithms |
| Reading: | 84-90 |
| Exercises: | 1,2,4,6,9 |
|
| See whole book
|
|
|