|
|
Reading Assignments and Suggested Exercises
| Book: | Introduction to The Design and Analysis of Algorithms, 1st edition | | Author: | Anany Levitin | | Chapter: | 3 |
| Section: 3.1 |
Selection and Bubble Sort |
| Reading: | 97-102 |
| Exercises: | 1,3,4,6,7,10 |
| | Section: 3.2 |
Sequential Search and Brute-Force String Matching |
| Reading: | 103-105 |
| Exercises: | 4,8,9,10 |
| | Section: 3.3 |
Closest-Pair and Convex-Hull Problems by Brute Force |
| Reading: | 107-111 |
| Exercises: | 9 |
| | Section: 3.4 |
Exhaustive Search |
| Reading: | 113-118 |
| Exercises: | 2,7,8,10 |
|
| See whole book
|
|
|