Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein

Contributor(s): Cormen, Thomas H | Stein, Clifford | Rivest, Ronald L | Leiseron, Charles E
Material type: TextTextPublisher: New Delhi : PHI Learning, 2016Copyright date: �2016Edition: Third editionDescription: xix, 1,292 pages : illustrations ; 24 cmContent type: text Media type: unmediated Carrier type: volumeISBN: 9788120340077 (paperback)Subject(s): Computer programming | Computer algorithms | Bilgasayar programlama | Bilgisayar algoritmalar�Additional physical formats: No titleOnline resources: Table of contents | Table of contents | Click here to access online
Contents:
I. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures. Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix: Mathematical background. Summations -- Sets, etc. -- Counting and probability -- Matrices
Summary: This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover]
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Copy number Status Date due Barcode
Core Textbook Collection Core Textbook Collection Main Library -University of Zimbabwe
Main Library Core Textbook Collections
Core Textbook Collections QA76.6 INT (Browse shelf) 1 Available 36200006210
Core Textbook Collection Core Textbook Collection Main Library -University of Zimbabwe
Main Library Core Textbook Collections
Core Textbook Collections QA76.6 INT (Browse shelf) 2 Available 36200006234
Core Textbook Collection Core Textbook Collection Main Library -University of Zimbabwe
Main Library Core Textbook Collections
Core Textbook Collections QA76.6 INT (Browse shelf) 3 Available 36200006258
Core Textbook Collection Core Textbook Collection Main Library -University of Zimbabwe
Main Library Core Textbook Collections
Core Textbook Collections QA76.6 INT (Browse shelf) 4 Available 36200006186

Eastern economy edition.

Includes bibliographical references (pages 1231-1250) and index

I. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures. Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix: Mathematical background. Summations -- Sets, etc. -- Counting and probability -- Matrices

This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover]

There are no comments on this title.

to post a comment.