Beginning Algorithms 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. What you will learn from this book The basics of algorithms, such as iteration and recursion Elementary data structures such as lists, stacks, and queues Basic and advanced sorting algorithms including insertion sort, quicksort, and shell sort Advanced data structures such as binary trees, ternary trees, and heaps Algorithms for string searching, string matching, hashing, and computational geometry How to use test-driven development techniques to ensure your code works as intended How to dramatically improve the performance of your code with hands-on techniques for profiling and optimization Who this book is for 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. Wrox Beginning guides are crafted to make learning programming languages and technologies easier than you think, providing a structured, tutorial format that will guide you through all the techniques involved. Getting Started -- Iteration And Recursion -- String Searching -- Lists -- Queues -- Stacks -- Basic Sorting -- Advance Sorting -- Priority Queues -- Binary Searching -- Binary Search Trees -- Red-black Trees -- Hashing -- Sets -- Maps -- Computational Geometry -- Digital Search Trees -- B-trees -- Pragmatic Optimization. Simon Harris And James Ross. Programmer To Programmer--cover. Includes Bibliographical References And Index. Do you want an introduction to algorithms and data structures without a lot of really intense math? Do you already know Java reasonably well? Do you no mind skipping over lengthy descriptions of unit tests? If you answered "yes" to all those questions, then this is a great book. I came away with a much deeper understanding of the topics covered and I found it engaging and easy to read.
