Fundamentals of Algorithmics : International Edition
This is an introductory-level algorithm text. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application.* structures material by techniques employed, not by the application area, so students can progress from the underlying abstract concepts to the concrete application essentials. * begins with a compact, but complete introduction to some necessary math, and also includes a long introduction to proofs by contradiction and mathematical induction. This serves to fill the gaps that many undergraduates have in their mathematical knowledge. * gives a paced, thorough introduction to the analysis of algorithms, and uses coherent notation and unusually detailed treatment of solving recurrences. * includes a chapter on probabilistic algorithms, and an introduction to parallel algorithms, both of which are becoming increasingly important. * approaches the analysis and design of algorithms by type rather than by application.
- Paperback | 524 pages
- 177 x 240 x 20mm | 755g
- 05 May 1995
- Pearson Education (US)
- United States
Table of contents
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.