Introduction to algorithms
Cormen, Thomas H. :
Introduction to algorithms - Cambridge, Massachusetts : MIT Press, 1990. - xvii, 1028 p. : illustrations ;
Included Index.
Growth of functions --
Summations --
Recurrences --
Sets, etc. --
Counting and probability --
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 --
Arithmetic circuits --
Algorithms for parallel computers --
Matrix operations --
Polynomials and the FFT --
Number-theoretic algorithms --
String matching --
Computational geometry --
NP-completeness --
Approximation algorithms.
There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference. Introduction to Algorithms covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so that it will be accessible to all levels of readers. Chapters are organized so that they start with elementary material and progress to more advanced topics. Each chapter is relatively self-contained and can be used as a unit of study. Algorithms are presented in a pseudocode that can be easily read by anyone familiar with Fortran, C, or Pascal. Numerous pertinent examples, figures, exercises, and case-study problems emphasize both engineering and mathematical aspects of the subject.
9788120313538 8120313534
Computer programming.
Computer algorithms.
Algorithms.
005.1 / COR
Introduction to algorithms - Cambridge, Massachusetts : MIT Press, 1990. - xvii, 1028 p. : illustrations ;
Included Index.
Growth of functions --
Summations --
Recurrences --
Sets, etc. --
Counting and probability --
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 --
Arithmetic circuits --
Algorithms for parallel computers --
Matrix operations --
Polynomials and the FFT --
Number-theoretic algorithms --
String matching --
Computational geometry --
NP-completeness --
Approximation algorithms.
There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference. Introduction to Algorithms covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so that it will be accessible to all levels of readers. Chapters are organized so that they start with elementary material and progress to more advanced topics. Each chapter is relatively self-contained and can be used as a unit of study. Algorithms are presented in a pseudocode that can be easily read by anyone familiar with Fortran, C, or Pascal. Numerous pertinent examples, figures, exercises, and case-study problems emphasize both engineering and mathematical aspects of the subject.
9788120313538 8120313534
Computer programming.
Computer algorithms.
Algorithms.
005.1 / COR