Introduction to Algorithms, 3rd Edition
Related Products
The latest edition of the 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; others 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 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 a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, 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 exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
ASIN : 0262033844
Publisher : MIT Press
Publication date : September 1, 2009
Edition : 3rd
Language : English
Print length : 1292 pages
ISBN-10 : 9780262033848
ISBN-13 : 978-0262033848
Item Weight : 4.86 pounds
Reading age : 18 years and up
Dimensions : 9.08 x 8.18 x 2.06 inches
Grade level : 12 and up
Best Sellers Rank: #354,204 in Books (See Top 100 in Books) #5 in Data Structure and Algorithms #16 in Computer Programming Structured Design #22,482 in Reference (Books)
Customer Reviews: 4.6 4.6 out of 5 stars (1,912) var dpAcrHasRegisteredArcLinkClickAction; P.when(‘A’, ‘ready’).execute(function(A) { if (dpAcrHasRegisteredArcLinkClickAction !== true) { dpAcrHasRegisteredArcLinkClickAction = true; A.declarative( ‘acrLink-click-metrics’, ‘click’, { “allowLinkDefault”: true }, function (event) { if (window.ue) { ue.count(“acrLinkClickCount”, (ue.count(“acrLinkClickCount”) || 0) + 1); } } ); } }); P.when(‘A’, ‘cf’).execute(function(A) { A.declarative(‘acrStarsLink-click-metrics’, ‘click’, { “allowLinkDefault” : true }, function(event){ if(window.ue) { ue.count(“acrStarsLinkWithPopoverClickCount”, (ue.count(“acrStarsLinkWithPopoverClickCount”) || 0) + 1); } }); });
Kindle Customer –
Excellent Introduction to CS for math majors
I am a math major who has taken a few cs courses from the cs department at my university. Up until reading this book cs has always been a bit of a mystery to me. I have heard a million and one time how cs is based on mathematics but aside from understanding the idea of traversing through arrays as you would the indexes of a sequence, I have never really seen the connection between the two subjects. This book does an amazing job of demonstrating the mathematical basis of cs. From the very beginning when the authors deconstruct the for-loop used in a insert-sort into a variation on mathematical induction the lines between the two subjects are made crystal clear.I would agree that a pretty solid understanding of mathematics is required for this book, and I can see why someone coming from a typical undergraduate education in cs would find it difficult and intimidating to tackle this book. It definitely does not teach you how to program or the basics of object oriented design as it proceeds to teach you about structure and design of algorithms. I can also understand why someone hoping to simply get a job as a “programmer” or “software engineer” would not necessarily be well served by this book. The authors are very upfront on this note though, and specifically warn prospective students that they are not going to teach them how to “code” solutions to common cs problems. What they are going to teach them is the fundamentals of algorithm analysis and design. How valuable prospective students find this approach is going to depend entirely on what exactly they hope to do with their understanding of computer science. If you want to learn how to code and be paid to be a developer (not a bad line of work by any stretch of the imagination) you might want to look else where.For someone coming from a mathematics background though (whether it’s an applied field such as statistics or numerical analysis or a pure field like abstract algebra or analysis) this is an excellent introduction to the field of computer science. If you are coming from a math background the analysis and structure of algorithms as presented in this book will instantly click. For me personally I loved the fact that the underlining mathematical basis of cs did not get lost in details of coding or working within certain developmental environments like Eclipse. Again, probably not an ideal choice for someone looking to learn this particular subjects, but definitely a good choice for math majors (or prospective cs grad students).