This book is intended to be a survey of today's most important computer algorithms and a collection of fundamental techniques for the growing number of people who need them. It is designed as a textbook for the second year of studying computer science, when students already have basic programming skills and are familiar with computer systems. The book may also be useful for self-study or as a reference for those developing computer systems or application programs, as it contains implementations of useful algorithms and detailed information about performance characteristics and client programs. The breadth of material covered makes this book a useful introduction to the field. The study of algorithms and data structures is the basis of any computer course, not just for programmers and computer science students. Everyone who uses a computer wants it to run faster and solve bigger problems. The algorithms in this book represent a compilation of basic knowledge acquired over the past 50 years and recognized as irreplaceable. From N-body system modeling in physics to deciphering the genetic code in molecular biology, the fundamental techniques described here are essential in any field of scientific research; From architectural design systems to aircraft modeling, they are essential in engineering calculations; and from database management systems to Internet search engines, they are essential parts of modern software systems. Here are just a few examples: As the scope of computer applications expands, so does the influence of the basic techniques described here. Before we begin developing a fundamental approach to the study of algorithms, we will develop data types for stacks, queues, and other low-level abstractions that we will then use throughout the book. We'll then look at fundamental algorithms for sorting, searching, graphs, and strings. The last chapter provides an overview of the material presented in the book in a broader context.