Introduction to algorithms /

Contributor(s): Cormen, Thomas H | Leiserson, Charles E | Rivest, Ronald L | Stein, CliffordMaterial type: TextTextPublication details: Cambridge, Mass. : MIT Press, c2009; New Delhi : PHI Learning, 2009Edition: 3rd edDescription: xix, 1292 p. : illISBN: 9780262033848 (hardcover : alk. paper); 0262033844 (hardcover : alk. paper); 9788120340077; 0262533057 (pbk. : alk. paper)Subject(s): Computer programming | Computer algorithmsDDC classification: 005.1
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
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
Reference Books Reference Books Main Library
Reference 		Reference 005.1 INT (Browse shelf(Opens below)) Available 015575
Reference Books Reference Books Main Library
Reference 		Reference 005.1 INT (Browse shelf(Opens below)) Available 015399
Total holds: 0

Includes 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

There are no comments on this title.

to post a comment.

© University of Vavuniya

---