Front cover image for Introduction to algorithms

Introduction to algorithms

This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover]
eBook, English, ©2009
Third edition View all formats and editions
MIT Press, Cambridge, Mass., ©2009
1 online resource (xix, 1292 pages) : illustrations
9780262270830, 9781628709131, 0262270838, 1628709138
676697295
I. Foundations. The role of algorithms in computing
Getting started
Growth of functions
Divide-and-conquer
Probabilistic analysis and randomized algorithms
II. Sorting and order statistics. Heapsort
Quicksort
Sorting in linear time
Medians and order statistics
III. Data structures. Elementary data structures
Hash tables
Binary search trees
Red-black trees
Augmenting data structures
IV. Advanced design and analysis techniques. Dynamic programming
Greedy algorithms
Amortized analysis
V. Advanced data structures. B-trees
Fibonacci heaps
van Emde Boas trees
Data structures for disjoint sets
VI. Graph algorithms. Elementary graph algorithms
Minimum spanning trees
Single-source shortest paths
All-pairs shortest paths
Maximum flow
VII. Selected topics. Multithreaded algorithms
Matrix operations
Linear programming
Polynomials and the FFT
Number-theoretic algorithms
String matching
Computational geometry
NP-completeness
Approximation algorithms
VIII. Appendix: Mathematical background. Summations
Sets, etc
Counting and probability
Matrices