Introduction to algorithms (Book, 2001) [WorldCat.org]
skip to content
Introduction to algorithms
Checking...

Introduction to algorithms

Author: Thomas H Cormen
Publisher: Cambridge, Mass. : MIT Press, ©2001.
Edition/Format:   Print book : English : 2nd edView all editions and formats
Summary:
The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible 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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Einführung
Educational tools (form)
Document Type: Book
All Authors / Contributors: Thomas H Cormen
ISBN: 0262032937 9780262032933 0070131511 9780070131514 0262531968 9780262531962
OCLC Number: 46792720
Notes: Revised edition of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.
Description: xxi, 1180 pages ; 24 cm
Contents: The role of algorithms in computing --
Getting started --
Growth of functions --
Recurrences --
Probabilistic analysis and randomized algorithms --
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 algorithms --
String matching--
Computational geometry --
NP-completeness --
approximation algorithms --
A. summations --
B. Sets, etc. --
C. Counting and probability.
Other Titles: Algorithms
Responsibility: Thomas H. Cormen [and others].

Abstract:

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

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

All user tags (5)

View most popular tags as: tag list | tag cloud

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.