After a long period of summarization, connecting the learned knowledge together can help memory
Data Structures and Algorithms
1. Data structure
1.1 Linear table
1.1.1 array array
1.1.2 linked list list
Singly linked list
Doubly linked list
Circular linked list
Doubly linked list
Static linked list
1.1.3 stack stack
sequential stack
chained stack
1.1.4 Team queue
Ordinary queue
Double-ended queue
Blocking queue
Concurrent queue
Blocking concurrent queue
1.2 Hash table
1.2.1 Hash function
1.2.2 Conflict Resolution
Linked list method
Open addressing
Other
1.2.3 Dynamic expansion
1.2.4 Bitmap
1.3 tree
1.3.1 Binary tree
Balanced binary tree
Binary search tree
Balanced binary search tree (AVL tree, red-black tree)
Complete binary tree
Full binary tree
Huffman tree
1.3.2 Multi-way search tree
B tree
B+ tree
2-3 tree
2-3-4 tree
1.3.3 Heap
Small Top Heap
Big Top Heap
Priority Queue
Fibonacci Heap
Binomial Heap
1.3.4 Others
tree array
line segment tree
1.4 Figure
Graph storage (adjacency matrix, adjacency list)
topological sorting
shortest path
critical path
minimum spanning tree
bipartite graph
maximum flow
2. Algorithms
2.1 Complexity Analysis
2.1.1 Space Complexity
2.1.2 Time Complexity
best
worst
average
_
2.2 Basic algorithm idea
Greedy Algorithm
Divide and Conquer Algorithm
Backtracking Algorithm
Enumeration Algorithm
Dynamic Programming
2.3 Sorting
2.1.1 0(n^2)
Bubble sort
Insertion sort
Selection sort
Hill sort
2.1.1 o(nlogn)
Merge Sort
Quick Sort
Heap Sort
2.1.1 o(n)
counting sort
radix sort
bucket sort
2.4 Search
Depth-first search
Breadth-first search
Heuristic search
2.5 Search
Linear table lookup
Hash table lookup
Tree lookup
2.6 String matching
Naive
KMP
Robin-Karp
Boyer-Moor
AC Automata
Trie
Suffix Array
2.7 Others
Number theory
Computational
geometry Probability analysis
Union search
Topological network
Matrix operation
Linear programming