Introduction to Algorithms

by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest

PREFACE

CHAPTER 1: INTRODUCTION

PART I: Mathematical Foundations

CHAPTER 2: GROWTH OF FUNCTIONS

CHAPTER 3: SUMMATIONS

CHAPTER 4: RECURRENCES

CHAPTER 5: SETS, ETC.

CHAPTER 6: COUNTING AND PROBABILITY

PART II: Sorting and Order Statistics

CHAPTER 7: HEAPSORT

CHAPTER 8: QUICKSORT

CHAPTER 9: SORTING IN LINEAR TIME

CHAPTER 10: MEDIANS AND ORDER STATISTICS

PART III: Data Structures

CHAPTER 11: ELEMENTARY DATA STRUCTURES

CHAPTER 12: HASH TABLES

CHAPTER 13: BINARY SEARCH TREES

CHAPTER 14: RED-BLACK TREES

CHAPTER 15: AUGMENTING DATA STRUCTURES

PART IV: Advanced Design and Analysis Techniques

CHAPTER 16: DYNAMIC PROGRAMMING

CHAP