Preface (preface)

Part I (Part I) Foundation

The first chapter is the function of algorithm in calculation.

Chapter II Introduction

Chapter III Functional Growth

The fourth chapter recursion (Recurrences)

Chapter 5 Probability analysis and randomization algorithm.

The second part is classification and order statistics.

Chapter VI Heapstart

Chapter VII Quick Sorting

Chapter VIII Linear Time Sorting

Chapter 9 Statistics of Median and Order.

Part III (Part III) Data Structure

Chapter 10 Basic Data Structure (Basic Data Structure)

Hash table in chapter 1 1

Chapter 12 method of bisection Tree

Chapter 13 Red and Black Trees

Chapter 14 Extending Data Structure

Part IV (Part IV) Advanced design and analysis technology.

Chapter 15 Dynamic Programming (Dynamic Programming)

Chapter 16 Greedy Algorithm

Chapter 17 Amortization Analysis

Part V (Part V) Advanced Data Structure.

Chapter 18 B-tree (B-tree)

Chapter 19 Binomial Reactor

Chapter 20 Fibonacci pile

Chapter 2 1 Data structure of disjoint sets.

Part VI: Graph algorithm.

Chapter 22 Basic Graphics Algorithm

Chapter 23 Minimum Spanning Tree

Chapter 24 Single Source Shortest Path

Chapter 25 The shortest path of all pairs

Chapter 26 Maximum flow

Part VII: Topic selection.

Chapter 27 Sorting Network

Chapter 28 Matrix Operation

Chapter 29 Linear Programming (linear programming)

Chapter 30 Polynomial and Fast Fourier Transform (Polynomial and Fast Fourier Transform)

Chapter 3 1 number theory algorithm

Chapter 32 String Matching

Chapter 33 Computational Geometry

Chapter 34 NP- completeness (NP- completeness)

Chapter 35 Approximation algorithm

Part VIII Appendix: Mathematical Background

Appendix a summary

Appendix b compilation, and so on. (sets, etc. )

Appendix c counting and probability

Bibliography (bibliography)

Index (index)