Beginning AlgorithmsISBN: 978-0-7645-9674-2
Paperback
600 pages
November 2005
 This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 10-15 days delivery time. The book is not returnable.
|
||||||
Acknowledgments.
Introduction.
Chapter 1: Getting Started.
Chapter 2: Iteration and Recursion.
Chapter 3: Lists.
Chapter 4: Queues.
Chapter 5: Stacks.
Chapter 6: Basic Sorting.
Chapter 7: Advanced Sorting.
Chapter 8: Priority Queues.
Chapter 9: Binary Searching and Insertion.
Chapter 10: Binary Search Trees.
Chapter 11: Hashing.
Chapter 12: Sets.
Chapter 13: Maps.
Chapter 14: Ternary Search Trees.
Chapter 15: B-Trees.
Chapter 16: String Searching.
Chapter 17: String Matching.
Chapter 18: Computational Geometry.
Chapter 19: Pragmatic Optimization.
Appendix A: Further Reading.
Appendix B: Resources.
Appendix C: Bibliography.
Appendix D: Answers to Exercises.
Index.
Related Titles
General Programming & Software Development
Read an Excerpt
.png){kind=small}
Join An E-mail ListLearn about the latest products, events, offers and content. |
