Introduction to algorithms

Contributor(s): Cormen, Thomas H | Cormen, Thomas HMaterial type: TextTextPublication details: Cambridge, Mass. : MIT Press, c2001; New Delhi : Prentise-Hall of India 2001Edition: 2nd ed. (Indian Print)Description: xxi, 1180 p. cmISBN: 9788120321410; 8120321413Subject(s): Computer programming | Computer algorithmsDDC classification: 005.1
Contents:
The role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algortihms -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash Tables -- Binary Search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy Algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Matrix operations-- Linear programming -- Polynomials and the FFT -- Number-theoretic algortihsm -- String matching-- Computational geometry -- NP-completeness -- approximation algorithms -- A. summations -- B. Sets, etc. -- C. Counting and probability.
Summary: The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible 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.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Lending Books Lending Books Main Library
Stacks 		Reference 005.1 INT (Browse shelf(Opens below)) Available 009235
Reference Books Reference Books Main Library
Reference 		Reference 005.1 INT (Browse shelf(Opens below)) Available 008286
Total holds: 0

Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.

Original ISBN 0262032937

The role of algorithms in computing --
Getting started --
Growth of functions --
Recurrences --
Probabilistic analysis and randomized algortihms --
Heapsort --
Quicksort --
Sorting in linear time --
Medians and order statistics --
Elementary data structures --
Hash Tables --
Binary Search trees --
Red-black trees --
Augmenting data structures --
Dynamic programming --
Greedy Algorithms --
Amortized analysis --
B-trees --
Binomial heaps --
Fibonacci heaps --
Data structures for disjoint sets --
Elementary graph algorithms --
Minimum spanning trees --
Single-source shortest paths --
All-pairs shortest paths --
Maximum flow --
Sorting networks --
Matrix operations--
Linear programming --
Polynomials and the FFT --
Number-theoretic algortihsm --
String matching--
Computational geometry --
NP-completeness --
approximation algorithms --
A. summations --
B. Sets, etc. --
C. Counting and probability.

The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible 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.

Click on an image to view it in the image viewer

© University of Vavuniya

---