Introduction To Algorithms

Cover
Thomas H Cormen
MIT Press, 2001 - 1180 Seiten
206 Rezensionen
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers.

There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness.

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.

The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
  

Was andere dazu sagen - Rezension schreiben

Bewertungen von Nutzern

5 Sterne
152
4 Sterne
38
3 Sterne
9
2 Sterne
5
1 Stern
2

Review: Introduction to Algorithms

Nutzerbericht  - Neda Bagheri - Goodreads

This book was our Reference book for Algorithm course in college. it was easy to read and for the covered materials look at the Bibliography. it covers the main subjects. Vollständige Rezension lesen

Review: Introduction to Algorithms

Nutzerbericht  - Cong - Goodreads

The organization is awesome. The pseudo code is very helpful. The problem is the formal style of writing. It would be much better if the author can hide the formal forms of proof in the appendix and ... Vollständige Rezension lesen

Inhalt

Introduction
3
Getting Started 75
15
Growth of Functions
41
Recurrences
62
Probabilistic Analysis and Randomized Algorithms
91
Introduction 797
197
Hash Tables
221
Augmenting Data Structures
302
Minimum Spanning Trees
561
SingleSource Shortest Paths
580
Maximum Flow
643
Introduction
701
Matrix Operations
725
Linear Programming
770
Polynomials and the FFT 522
822
NumberTheoretic Algorithms
849

Introduction
321
Greedy Algorithms
370
Introduction
431
Binomial Heaps
455
Fibonacci Heaps
476
Data Structures for Disjoint Sets
498
Introduction
525
NPCompleteness
966
Introduction 7057
1057
B Sets Etc 7070
1070
Counting and Probability
1094
Bibliography
1127
Index 7745
1145
Urheberrecht

Häufige Begriffe und Wortgruppen

Verweise auf dieses Buch

Distributed Algorithms
Nancy A. Lynch
Eingeschränkte Leseprobe - 1996
Alle Ergebnisse von Google Books »

Über den Autor (2001)

Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College. Cormen is one of the authors of Introduction to Algorithms.

Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.

Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.

Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.

Bibliografische Informationen