Image from Google Jackets

Introduction to Algorithms Second Edition Thomas H. Cormen ; Charles E. Leiserson ; Ronald L. Rivest.

By: Contributor(s): Material type: TextTextPublication details: Boston, USA McGraw-Hill Book 2005.Edition: 2nd edDescription: 1180 p. ill. 18 cmISBN:
  • 9780262531962
  • 0262531968
Subject(s): DDC classification:
  • 005.1   22 COR
Scope and content: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Book - Borrowing Book - Borrowing Central Library Lower Floor Baccah 005.1 COR (Browse shelf(Opens below)) Available 000029141
Book - Borrowing Book - Borrowing Central Library Lower Floor Baccah 005.1 COR (Browse shelf(Opens below)) Available 000029142
Total holds: 0

Includes bibliographical referencese and index.

Sixth Printing, 2005.

2001 print by the Massachusetts Institute of Technology.

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.

There are no comments on this title.

to post a comment.