|
|
Reading Assignments and Suggested Exercises
| Book: | Introduction to The Design and Analysis of Algorithms, 1st edition | | Author: | Anany Levitin | | Chapter: | 4 |
| Section: 4.1 |
Mergesort |
| Reading: | 121-126 |
| Exercises: | 5,10,17 |
| | Section: 4.2 |
Quicksort |
| Reading: | 127-132 |
| Exercises: | 5,6,7,8,10 |
| | Section: 4.3 |
Binary Search |
| Reading: | 133-136 |
| Exercises: | 4,5,6,10 |
| | Section: 4.4 |
Binary Tree Traversals and Related Problems |
| Reading: | 138-140 |
| Exercises: | 1,2,8 |
| | Section: 4.5 |
Multiplication of Large Integers and Strassen's Matrix Multiplication |
| Reading: | 142-146 |
| Exercises: | 6,7,8,10 |
| | Section: 4.6 |
Closest-Pair and Convex-Hull Problems by Divide-and-Conquer |
| Reading: | 147-151 |
| Exercises: | 1 |
|
| See whole book
|
|
|