Introduction to Algorithms, 3d edition (The MIT .Press)
The latest Edition of essential text and professional reference, with substantial new material on such topics as veb trees, multithreaded algorithms, dynamic programming , and edge-based flow.
Some books on algorithms are rigorous but incomplete, other cover masses of material but lack rigor. introduction to algorithms uniquely 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 describe in english and in a pseudocode designed to readable by anyone who has done a little programmingg. the explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The first edition became a widely used text in universities worldwide as well as the standard reference for professional. the second edition featured new chapter on the roll of algorithms, probabilistic analysis and randomized algorithms, and linier programming. the third edition has been revised and updated throughout. it includes two completely new chapter, on van emde boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "divide-and --conquer), and an appendix on matrices. it features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. many exercise and problem have been added for this edition. the international paper edition is no longer available, the handcover is available worldwide.
Editorial reviews
Review
"" Introduction to algorithms, " the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynominal-time algorithms for seemingty intractable problem, from classical algorithms in grph theory to special algorithms for string matching, computational geometry, and number theory. the revised third edition notably adds a chapter on van emde boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importane. "--Daniel Spielmen, Department of Computer Science, Yale University.
" In light of the explosive growht in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever.this beutiful written , thoughtfully organized boo is the definitive introductory book on the design and analysis of algorithms. the first half offers an effetive method to teach and study algorthms, the seond half then engages more advaned readers and orius student with ompelling material on both the possibilities and the Challenge in this fascinating field . "--Shang-Hua Teng, University of Shouthern California
"As an educator and researcher in the field of algorithms for over tho decade, i an unequivocally say that the ormen book is the best textbook that i have ever seen on this subject, it offers an incisive, encylopedic, and modern treatment of algorithms, and our department will continue to use it for teahing at both the graduate and undergraduate levels, as well as a reliable research reference."--Gabriel Robins, Department of computer science, university of virginia
Review
As an educator and research in the field of algorithm for over two decade, i can unequivocally say that the cormen et al book is the best textbook that i have ever seen on this subjet. it offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will ontnue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable researh reference.
--Gabriel Robins, Department of Computer Sience, University of virginia
Introduction to algorithms, the bible of the field is a comprehensive textbook covering the full spectrum of modern algorithms, from the fastest algorithms and data structures to polynominal time algorithms for seemingly intractable problem, from classical algorithms in graph theoryto special algorithms for string matching, computational geometry, and number theory. the revised third edition notably adds a chapter on van boas trees, one of the most useful data structure, and on multitreaded algorithms, a topic of increasing impotance.
--Daniel Spielman, Department of Computer Science, Yale University.
About the Author
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009).
Product details
Series: The MIT Press
Hardcover: 1312 pages
Publisher: The MIT Press; 3rd edition (July 31, 2009)
Language: English
ISBN-10: 9780262033848
ISBN-13: 978-0262033848
ASIN: 0262033844
Product Dimensions: 8 x 2 x 9 inches
Shipping Weight: 5.1 pounds (View shipping rates and policies)
Average Customer Review: 4.3 out of 5 stars 596 customer reviews
Amazon Best Sellers Rank: #9,613 in Books (See Top 100 in Books)
#2 in Books > Textbooks > Computer Science > Algorithms
#2 in Books > Computers & Technology > Programming > Algorithms > Data Structures
#59 in Books > Computers & Technology > Computer Science
Curious about AI but don’t know where to start? Join more than 15,000 readers who have used this beginner-friendly guide to understand AI, build confidence, and start using practical tools in everyday life, no tech skills needed.
