A total of 16 chapters, total four parts: basic knowledge, data structure, sorting and searching.
All implementations are using the C language abbreviation. Any language has advantages and disadvantages, the choice of C language is because it is widely used.
Chapter One: Introduction
Chapter II: Principles of Algorithm analysis
Chapter III: BASIC Data Structures
The fourth chapter: abstract data
The fifth chapter: recursion and numeric
The sixth chapter: the basic sorting method
The seventh chapter: Quick Sort
The eighth chapter: Merge and Merge sort
Nineth: Priority queue and heap sequencing
The tenth chapter: the Cardinal sort
The 11th chapter: The sorting method of special purpose
The 12th chapter: symbol table and two-fork search tree
13th Chapter: Balance Tree
14th Chapter: Hashing method
15th Chapter: Cardinality Search
16th Chapter: External Search
Data structure algorithm [C language]