Introduction to algorithms / Thomas H. Cormen ... [et al.].
Material type: TextLanguage: English Publication details: Cambridge, Massachusetts : MIT Press, c2009.Edition: 3rd edDescription: xix, 1292 p. : ill. ; 24 cmISBN:- 9780262033848
- QA76.6 .C67 2009
Item type | Current library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
eBook (Electronic Book) | North South University Library | Non-fiction | Online | QA76.6.I5858 2009 (Browse shelf(Opens below)) | 1 | Not for loan | 500010268 | ||
Books | North South University Library | Non-fiction | QA76.6.I5858 2009 (Browse shelf(Opens below)) | 1 | Available | 31325 | |||
Books | North South University Library | Non-fiction | QA76.6.I5858 2009 (Browse shelf(Opens below)) | 2 | Available | 34836 |
Browsing North South University Library shelves, Shelving location: Online, Collection: Non-fiction Close shelf browser (Hides shelf browser)
QA39.3 .R67 2003 Discrete mathematics and its applications / | QA39.3.R67 2011 Discrete mathematics and its applications : with combinatorics and graph theory / | QA76.6.B46 2000 Programming pearls / | QA76.6.I5858 2009 Introduction to algorithms / | QA76.6.T46 2020 The pragmatic programmer, 20th anniversary edition : journey to mastery / | QA76.64.D47 1995 Design patterns : elements of reusable object-oriented software / | QA76.73.C15.K63 2005 Programming in C / |
Includes bibliographies and index.
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.
Computer Science & Engineering
Mathematics, Physics & Statistics
Md. Abdul Hakim
Md. Rifat Mahmud
There are no comments on this title.