Introduction to algorithms

By:

Cormen, Thomas H

Contributor(s):

Material type: Text

TextPublication details: New Delhi PHI Learning Pvt Ltd 2009Edition: 3rd edDescription: xix, 1292 pISBN:

9780262033848 (pbk.)

Subject(s):

DDC classification:

005.1 COR

Online resources:

Click here to access online

Summary: "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"

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Book	Plaksha University Library	Computer science	005.1 COR (Browse shelf(Opens below))	Available		001067
Book	Plaksha University Library	Computer science	005.1 COR (Browse shelf(Opens below))	Checked out	26/10/2024	001068
Book	Plaksha University Library	Computer science	005.1 COR (Browse shelf(Opens below))	Checked out	04/02/2025	001069
Book	Plaksha University Library	Computer science	005.1 COR (Browse shelf(Opens below))	Available		001070

"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"

There are no comments on this title.

to post a comment.