Chapter 1-Algorithm Basics
1.1 Algorithm Complexity Calculation
1.2 The Magical Rabbit Sequence
Chapter 2-Linear Table
2.1 Linked List
2.2 Linked List Examples
Chapter 3-Stacks and Queues
3.1 Stacks
3.2 Queues
Chapter 4-Array
4.1 Array
4.2 Compressed Storage of Special Matrix
Chapter 5-String
5.1 String
5.2 KMP Algorithm
Chapter 6-Binary Tree
6.1 Binary Tree Storage
6.2 Binary Tree Traversal
Chapter 7-Tree + Greed
7.1 Huffman Tree
7.2 Huffman Coding
Chapter 8-Graph Storage
8.1 Adjacency Matrix
8.2 Adjacency List
Chapter 9-Graph Search
9.1 Depth First Search
9.2 Breadth First Search
Chapter 10-Graph Connectivity
10.1 Connected Components
10.2 Tarjan Algorithm
Chapter 11-Graph + Greed
11.1 Shortest Path
11.2 Dijkstra, Floyd Algorithm
11.3 Minimum Spanning Tree
11.4 Prim, Kruskal Algorithm
Chapter 12-Application of Graphs
12.1 Topological Sorting (1)
12.2 Topological Sorting (2)
12.3 Critical Path (1)
12.4 Critical Path (2)
Chapter 13-Find + Divide and Conquer
13.1 Binary Search
13.2 Hash Table
Chapter 14-Number Table Search
14.1 Binary Search Tree (1)
14.2 Binary Search Tree (2)
14.3 Balanced Binary Tree (1)
14.4 Balanced Binary Tree (2)
Chapter 15-Simple Sort
15.1 Insertion Sort
15.2 Bubble Sort
Chapter 16-Sort + Divide and
Conquer 16.1 Quick Sort
16.2 Merge Sort
Chapter 17-Tree Sort
17.1 Select Sort
17.2 Heap Sort
Chapter 18-Allocation Sort
18.1 Bucket Sort
18.2 Cardinal Sort
Chapter 19-Advanced Data Structure
19.1 Union Check Set (1)
19.2 Union Check Set (2)
19.3 Priority Queue (1)
19.4 Priority Queue (2)
19.5 Tree Array (1)
19.6 Tree Array (2)
19.7 Line segment tree (1)
19.8 Line segment tree (2)
19.9 double, ST table, RMQ (1)
19.10 double, ST table, RMQ (2)
19.11 LCA (1)
19.12 LCA (2)
19.13 Treap tree (1)
19.14 Treap tree (2)
19.15 Tree chain division (1)
19.16 Tree chain division (2)
19.17 Dictionary tree (1)
19.18 Dictionary tree (2)
19.19 Suffix array (1)
19.20 Suffix array (2)
19.21 Blocking (1)
19.22 Partition (two)
19.23 point divide and conquer (one)
19.24 point divide and conquer (two)
19.25 edge divide and conquer (one)
19.26 edge divide and conquer (two)
19.27 AC automata (one)
19.28 AC automata (two)
19.29 B- Tree (1)
19.30 B-tree (2)
19.31 B-tree (3)
19.32 B-tree (4)
19.33 Red-black tree (1)
19.34 Red-black tree (2)
19.35 Red-black tree (3)
19.36 Red-black tree (4)
19.37 Stretching tree Splay (1)
19.38 Stretching tree Splay (2)
19.39 KD tree (1)
19.40 KD tree (2)
19.41 Dynamic tree (1)
19.42 Dynamic tree (2)
19.43 Left-side tree ( combinable heap) (1)
19.44 Left-side tree ( combinable heap) (2)
19.45 SBT tree (1)
19.46 SBT tree (2)
19.47 Jump table (1)
19.48 Jump table (2)
19.49 Tree set tree (1)
19.50 Tree set tree (2)
19.51 Persistent data structure (1)
19.52 Persistent data structure (two)
Chapter 20-Greedy + Dynamic Programming
20.1 Knapsack Problem
20.2 01 Knapsack Problem
Chapter 21-Dynamic Programming
21.1 Linear DP
21.2 Longest Common Subsequence, Longest Ascending
Subsequence 21.3 Tree DP
21.4 Backpack Tree DP
21.5 Interval DP
21.6 Matrix Multiplication, Stone Combination
21.7 Digital DP
21.8 Number Game
21.9 State Compression DP
21.10 Traveling Salesman
21.11 Plug DP
Chapter 22-Dynamic Programming Optimization
22.1 Multiplication Optimization
22.2 Data Structure Optimization
22.3 Monotonic Queue Optimization
22.4 Slope Optimization
22.5 Quadrilateral Inequality Optimization
Chapter 23-Deep Search Application
23.1 Backtracking Method
23.2 01 Backpack
23.3 Map Coloring
23.4 n Queen
23.5 Optimal Processing Order
Chapter 24-Breadth Search Application
24.1 01 Backpack
24.2 Traveling Salesman Problem
Chapter 25-Heuristic Search
25.1 A Search (1)
25.2 A Search (2)
Chapter 26-Maximum Flow
26.1 Shortest Augmented Path Algorithm
26.2 Dinic Algorithm
Chapter 27-Maximum Flow Improved Algorithm
27.1 Label Algorithm IPA (1)
27.2 Label Algorithm ISPA (2)
Chapter 28-Bipartite Graph Maximum Matching
28.1 Pairing Scheme
28.2 Hungarian Algorithm
Chapter 29-Maximum Flow Minimum Cut
29.1 Maximum Profit
29.2 Grid Access
Chapter Thirty-Minimum Cost and Maximum Flow
30.1 Minimum Cost Path Algorithm
30.2 Elimination Cycle Algorithm