Cover image
Normal view MARC view ISBD view

Introduction to algorithms /

by Cormen, Thomas H. ... [et al.].
Material type: materialTypeLabelBookPublisher: New Delhi : Prentice-Hall of India Private Limited, c2001Edition: 2nd ed.Description: xxi, 1180 p. ; 25 cm.ISBN: 0262032937; 8120321413 ; 0262531968 ; 0262032937 ; 9780262032933; 9788120321410.Other title: Algorithms.Subject(s): Computer programming | Computer algorithmsOnline resources: WorldCat details | Ebook Fulltext
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. Table of contents
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 Location Collection Call number Status Date due
E-Book E-Book E-book Non Fiction 005.1 INT 2001 (Browse shelf) Not for loan

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

Includes bibliographical references (p. [1127]-1130) and index.

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. Table of contents

Computer Science & Engineering

Abdul Gani

There are no comments for this item.

Log in to your account to post a comment.

Library Home | Contacts | E-journals

Last Update on 12 January 2014
Copyright @ 2011-2015 EWU Library
East West University