Beschreibung
Data structures and algorithms are presented at the college level in a way that is unique in content and presentation from current available texts. A highly accessible format presents algorithms with one page displays that will appeal to both students and teachers of computer science. The thirteen chapters systematically and comprehensively cover Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Discrete Fourier Transform, Strings, Graphs, Parallel Computation.
Autorenporträt
InhaltsangabePreface * 1. RAM Model * 2. Lists * 3. Induction and Recursion * 4. Trees * 5. Algorithm Design * 6. Hashing * 7. Heaps * 8. Balanced Trees * 9. Sets Over a Small Universe * 10. Graphs * 11. Strings * 12. Discrete Fourier Transform (DFT) * 13. Parallel Computation * Appendix of Common Sums * Bibliography * Notation * Index
Herstellerkennzeichnung:
Springer Basel AG in Springer Science + Business Media
Heidelberger Platz 3
14197 Berlin
DE
E-Mail: juergen.hartmann@springer.com
