- binary search
- divide conquer
- breadth first search: 由于使用的是队列,不用递归,实现时比dfs简单
- depth first search
- backtracking
- two pointer
- dynamic programming : 二维及以上的 DP动态规划,可以考虑用滚动数组(rolling array)来优化
- scan-line algorithm
- sort: quick sort,heap
- stack
- queue
- linked list
- array
- hash table
- binary tree
- heap
- union find 并查集
- trie 字典树