Introduction to Algorithms | Edition: 3
Author: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
ISBN: 9780262033848
publisher: MIT Press
publisher Date: 07/31/2009
Price: 94
eBookPrice: 0
Schools: Temple University,University of South Carolina,University of Houston,George Mason University,Washington State University,Illinois Institute of Technology,Rochester Institute of Technology,University of Maryland College Park,University of Michigan -Flint,Wayne State University,Mississippi State University,Rutgers,The State University of New Jersey,The University of South Dakota,University of Tennessee at Chattanooga,Tufts University,Worcester Polytechnic Institute,Minnersota State University at Mankato,University of Nevada - Las Vegas,Texas A&M University,Pace University-New York City,Indiana University -Purdue University Indianapolis,University of Michigan -Ann Arbor North,University of Michigan -Dearborn,Unversity of Mississippi,Rutgers,The State University of New Jersey-Camden,Stony Brook University(SUNY),University at Albany (SUNY),University of Chicago,Massachusetts Institute of Technology,Dartmouth College,Georgia Institute of Techology,Louislana State University,University of New Hampshire,The University of Michigan - Ann Arbor,Penn State University,College of William and Mary,Emory University,Tulane University,Boston University,Brandeis Univeisity,Johns Hopkins University,Columbia University,University of Rochester,Wellesley College,Drexel University,Lehigh University,University Of Pennsylvnaia,Southern Methodist University,Colorado School of Mines,University of Delaware,Case Western Reserve University,University of North Carolina at Charlotte,University of North Carolina at Greensboro,New Mexico State University
Description: 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.