Chapter One
Complexity Estimation and Sorting Algorithms (Part 1)
1) Recognize time complexity and space complexity
2) Recognize logarithm
3) Bubble sort
4) Selection sort
5) Insertion sort
6) How to analyze the time complexity of recursive process
7) Merge sort
8) Small sum problems
Chapter two
Complexity Estimation and Sorting Algorithms (Part 2)
1) Dutch flag problem
2) Random quick sort
3) Heap structure and heap sort
4) Recognize the stability of sorting algorithms
5) Recognize comparators
6) Bucket sort
7) Counting sort
8) Radix sort
9) Maximum difference after array sorting Value problem
10) Application of sorting algorithm in engineering
third chapter
Introduction to stack, queue, linked list, array and matrix structure and explanation of common interview questions
1) Introduce stack structure and its interview questions
2) Introduce queue structure and its interview questions
3) Introduce linked list structure and its interview questions
4) Introduce array structure and its interview questions
5) Introduce matrix structure and its interview questions
6) Binary search expand
Chapter Four
binary tree structure
1) Binary tree structure
2) Recursive and non-recursive traversal of
binary tree 3) Printing binary tree
4) Judging and searching binary tree
5) Judging complete binary tree
6) Judging balanced binary tree
7) Origami problem
8) The predecessor node and successor node of binary tree node
9) Binary tree Serialize and deserialize
chapter Five
Three Structures and Unions Related to Hash Functions
1）哈希函数与哈希表
2）布隆过滤器详解
3）一致性哈希结构
4）并查集结构与应用（岛问题）
第六章
图算法
1）图结构的表示方法
2）图的深度优先遍历与宽度优先遍历
3）拓扑排序问题
4）最小生成树问题
5）单源最短路径问题
第七章
前缀树、堆结构和贪心算法
1）前缀树
2）堆结构的扩展与应用
3）介绍贪心算法及其相关题目
4）在面试中如何快速的尝试出贪心策略
第八章
暴力递归到动态规划
1）递归
2）动态规划
3）如何把暴力递归套路的变成动态规划