This book provides an easy-to-read introduction to computer algorithms. It describes a number of important classical algorithms and tells when each is appropriate. It explains how to analyze algorithms to understand their behavior. Most importantly it teaches techniques that the reader can use to create new algorithms to meet future needs. Some of the useful algorithms that this book describes include: Methods for manipulating common data structures such as arrays, linked lists, trees, and networks Using more advanced data structures such as heaps, 2-3 trees, B-trees Sorting and searching Network algorithms such as shortest path, spanning tree, topological sorting, redundancy, and flow calculations Numerical algorithms such as numeric integration, finding level curves, plotting unknown functions, and curve fitting Some of the general problem-solving techniques that this book explains include: Brute force and exhaustive search Divide and conquer Backtracking Recursion Branch and bound Greedy algorithms and hill climbing Least cost algorithms Constricting bounds Heuristics In addition to describing these algorithms and approaches, this book explains how to analyze the performance of algorithms.