Algorithms in a Nutshell: A Desktop Quick Reference, 2nd Edition

Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs—with just enough math to let you understand and analyze algorithm performance.

With its focus on application, rather than theory, this book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each major algorithm is presented in the style of a design pattern that includes information to help you understand why and when the algorithm is appropriate.

With this book, you will:

• Solve a particular coding problem or improve on the performance of an existing solution
• Quickly locate algorithms that relate to the problems you want to solve, and determine why a particular algorithm is the right one to use
• Get algorithmic solutions in C, C++, Java, and Ruby with implementation tips
• Learn the expected performance of an algorithm, and the conditions it needs to perform at its best
• Discover the impact that similar design decisions have on different algorithms
• Learn advanced data structures to improve the efficiency of algorithms

Table of Contents

Chapter 1. Thinking in Algorithms
Chapter 2. The Mathematics of Algorithms
Chapter 3. Algorithm Building Blocks
Chapter 4. Sorting Algorithms
Chapter 5. Searching
Chapter 6. Graph Algorithms
Chapter 7. Path Finding in AI
Chapter 8. Network Flow Algorithms
Chapter 9. Computational Geometry
Chapter 10. Spatial Tree Structures
Chapter 11. Emerging Algorithm Categories
Chapter 12. Epilogue: Principles of Algorithms
Appendix A. Benchmarking