## Introduction to AlgorithmsThe latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide. |

### What people are saying - Write a review

#### LibraryThing Review

User Review - IvanIdris - LibraryThingThis book is like an encyclopedia of algorithms. The algorithms are presented with pseudo code so it doesn’t matter what your favorite programming language is. A very rigorous mathematical approach is used for the analysis of for instance performance. Read full review

Great reference book for algorithms.

### Contents

II Sorting and Order Statistics | 146 |

III Data Structures | 228 |

IV Advanced Design and Analysis Techniques | 356 |

V Advanced Data Structures | 480 |

VI Graph Algorithms | 586 |

VII Selected Topics | 768 |

Mathematical Background | 1142 |

1231 | |

1251 | |

### Other editions - View all

Introduction to Algorithms Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein Limited preview - 2009 |