Introduction to Algorithms
Publication details: US MIT 2022 Edition: 4thISBN: 978-0262046305Subject(s): MSc ITDDC classification: R 511.8 Summary: Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout. New for the fourth edition New chapters on matchings in bipartite graphs, online algorithms, and machine learning New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays 140 new exercises and 22 new problems Reader feedback–informed improvements to old problems Clearer, more personal, and gender-neutral writing style Color added to improve visual presentation Notes, bibliography, and index updated to reflect developments in the field| Cover image | Item type | Home library | Call number | Materials specified | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
|
|
REF
|
Parvatibai Chowgule College of Arts and Science, Margao Reference | R 511.8 COR.LEI (Browse shelf(Opens below)) | Not for loan | PCC-511.8 |
Browsing Parvatibai Chowgule College of Arts and Science, Margao shelves, Shelving location: Reference Close shelf browser (Hides shelf browser)
|
No cover image available | No cover image available |
|
|
|
No cover image available | ||
| R 469.32 oxf/oxf Oxford Essential Portuguese Dictionary | R 510 AIEEE AIEEE Mathematics | R 510.3 MCD A Dictionary of Mathematics | R 511.8 COR.LEI Introduction to Algorithms | R 523.8 TIR/CAM The Cambridge Star Atlas | R 530 ADA.ALL Advanced Physics | R 537.6 GRE/Cla Classical Electrodynamics |
Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout.
New for the fourth edition
New chapters on matchings in bipartite graphs, online algorithms, and machine learning
New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays
140 new exercises and 22 new problems
Reader feedback–informed improvements to old problems
Clearer, more personal, and gender-neutral writing style
Color added to improve visual presentation
Notes, bibliography, and index updated to reflect developments in the field
There are no comments on this title.