Introduction To Algorithms
- ISBN-10
- 0262032937
- ISBN-13
- 9780262032933
- Series
- Introduction to Algorithms
- Category
- Computers
- Pages
- 1180
- Language
- English
- Published
- 2001
- Publisher
- MIT Press
- Authors
- Thomas H Cormen, Charles E Leiserson, Ronald L Rivest
Description
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers. There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
Get the book
Other editions
Similar books
-
Introduction to Algorithms, third edition
By Thomas H. Cormen, Clifford Stein, Charles E. LeisersonMany exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
-
Introduction to Algorithms, Fourth Edition
By Thomas H. Cormen, Clifford Stein, Charles E. LeisersonThis fourth edition has been updated throughout, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, ...
-
Introduction to Algorithms and Java CD-ROM
By Clifford Stein, Thomas Cormen, Charles LeisersonLike the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.
-
Algorithms Unlocked
By Thomas H. CormenThe answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms.
-
Introduction to Algorithms: A Practical Approach to Algorithms
By Michael DavidThis book covers techniques for the design and analysis of algorithms.
-
Introduction to Algorithms for Data Mining and Machine Learning
By Xin-She YangIntroduction to Algorithms for Data Mining and Machine Learning introduces the essential ideas behind all key algorithms and techniques for data mining and machine learning, along with optimization techniques.
-
Introduction to Algorithms (Instructor's Manual)
By Thomas H. Cormen, Clifford Stein, Charles E. LeisersonUnlike the instructor's manual for the first edition of the text-which was organized around the undergraduate algorithms course taught by Charles Leiserson at MIT in Spring 1991-we have chosen to organize the manual for the second edition ...
-
An Introduction to Data Structures and Algorithms
By J.A. StorerThe material is suitable for undergraduates or first-year graduates who need only review Chapters 1 -4. * This book may be used for a one-semester introductory course (based on Chapters 1-4 and portions of the chapters on algorithm design, ...
-
Algorithms from THE BOOK
By Kenneth LangeThe best algorithms are undergirded by beautiful mathematics. This text cuts across discipline boundaries to highlight some of the most famous and successful algorithms.
-
Fullstack React: The Complete Guide to ReactJS and Friends
By Accomazzo Anthony, Murray Nathaniel, Ari LernerLEARN REACT TODAY The up-to-date, in-depth, complete guide to React and friends. Become a ReactJS expert today