Register your product to gain access to bonus material or receive a coupon.
This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. KEY TOPICS: Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application.
1. Preliminaries.
2. Elementary Algorithmicss.
3. Asymptotic Notation.
4. Analysis of Algorithms.
5. Some Data Structures.
6. Greedy Algorithms.
7. Divide-And-Conquer.
8. Dynamic Programming.
9. Exploring Graphs.
10. Probabilistic Algorithms.
11. Parallel Algorithms.
12. Computational Complexity.
13. Heuristic and Approximate Algorithms.
References.
Index.