Buch, Englisch, 592 Seiten, Format (B × H): 195 mm x 235 mm, Gewicht: 1112 g
Buch, Englisch, 592 Seiten, Format (B × H): 195 mm x 235 mm, Gewicht: 1112 g
ISBN: 978-0-273-76411-3
Verlag: Pearson International
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasises the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving.
Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
Autoren/Hrsg.
Weitere Infos & Material
- 1 Introduction
- 2 Fundamentals of the Analysis of Algorithm Efficiency
- 3 Brute Force and Exhaustive Search
- 4 Decrease-and-Conquer
- 5 Divide-and-Conquer
- 6 Transform-and-Conquer
- 7 Space and Time Trade-Offs
- 8 Dynamic Programming
- 9 Greedy Technique
- 10 Iterative Improvement
- 11 Limitations of Algorithm Power
-
12 Coping with the Limitations of Algorithm Power
