Beginning Algorithms (with source code)

A good understanding of algorithms, and the knowledge of when to apply them, is crucial to producing software that not only works correctly, but also performs efficiently. This is the only book to impart all this essential information-from the basics of algorithms, data structures, and performance characteristics to the specific algorithms used in development and programming tasks.

Packed with detailed explanations and instructive examples, the book begins by offering you some fundamental data structures and then goes on to explain various sorting algorithms. You'll then learn efficient practices for storing and searching by way of hashing, trees, sets, and maps. The authors also share tips on optimization techniques and ways to avoid common performance pitfalls. In the end, you'll be prepared to build the algorithms and data structures most commonly encountered in day-to-day software development.

This book is for anyone who develops applications, or is just beginning to do so, and is looking to understand algorithms and data structures. An understanding of computer programming is beneficial.

TABLE OF CONTENT:
Chapter 01 - Getting Started
Chapter 02 - Iteration and Recursion
Chapter 03 - Lists
Chapter 04 - Queues
Chapter 05 - Stacks
Chapter 06 - Basic Sorting
Chapter 07 - Advanced Sorting
Chapter 08 - Priority Queues
Chapter 09 - 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

Download here

Password:ganelon