There are books on algorithms that are rigorous but not completeand books that cover masses of material but are not rigorous.Introduction to Algorithms combines the attributes ofcomprehensiveness and comprehensibility.It will be equallyuseful as a text, a handbook, and a general reference.

Introduction to Algorithms covers both classical materialand such modern developments as amortized analysis and parallelalgorithms.The mathematical exposition, while rigorous, iscarefully detailed so that it will be accessible to all levelsof readers.Chapters are organized so that they start withelementary material and progress to more advanced topics.

Each chapter is relatively self-contained and can be used as aunit of study.Algorithms are presented in a pseudocode that canbe easily read by anyone familiar with Fortran, C, or Pascal.Numerous pertinent examples, figures, exercises, and case-studyproblems emphasize both engineering and mathematical aspectsof the subject.

Written by top researchers, this text blends theory and practice and covers the modern topics of parallel algorithms and concurrency and recurrency. A McGraw-Hill/MIT Press collaboration, the text is designed for both the instructor and the student. It offers a flexible organization with self-contained chapters, and it provides an introduction to the necessary mathematical analysis. Introduction to Algorithms contains sections that gently introduce mathematical techniques for students who may need help. This material takes students at an elementary level of mathematical sophistication and raises them to a level allowing them to solve algorithmic problems. The book addresses programming to allow engineering to be practiced in problem-solving, job-oriented tasks. Simple, easy-to-do exercises, as well as more thoughtful, step-by-step case-generated problems are included. The book features standard analytic notation and includes trimmed-down, easy-to-read pseudocode.

There are books on algorithms that are rigorous but not completeand books that cover masses of material but are not rigorous.Introduction to Algorithms combines the attributes ofcomprehensiveness and comprehensibility.It will be equallyuseful as a text, a handbook, and a general reference.

Introduction to Algorithms covers both classical materialand such modern developments as amortized analysis and parallelalgorithms.The mathematical exposition, while rigorous, iscarefully detailed so that it will be accessible to all levelsof readers.Chapters are organized so that they start withelementary material and progress to more advanced topics.

Each chapter is relatively self-contained and can be used as aunit of study.Algorithms are presented in a pseudocode that canbe easily read by anyone familiar with Fortran, C, or Pascal.Numerous pertinent examples, figures, exercises, and case-studyproblems emphasize both engineering and mathematical aspectsof the subject.

Written by top researchers, this text blends theory and practice and covers the modern topics of parallel algorithms and concurrency and recurrency. A McGraw-Hill/MIT Press collaboration, the text is designed for both the instructor and the student. It offers a flexible organization with self-contained chapters, and it provides an introduction to the necessary mathematical analysis. Introduction to Algorithms contains sections that gently introduce mathematical techniques for students who may need help. This material takes students at an elementary level of mathematical sophistication and raises them to a level allowing them to solve algorithmic problems. The book addresses programming to allow engineering to be practiced in problem-solving, job-oriented tasks. Simple, easy-to-do exercises, as well as more thoughtful, step-by-step case-generated problems are included. The book features standard analytic notation and includes trimmed-down, easy-to-read pseudocode.