{%hackmd theme-dark %}
演算法學習共筆
===
<!-- 書本模式 -->
基本技巧
---
- 遞迴
- 暴力枚舉
- 模擬
- Divide & Conquer
- Sort
- Binary Search
- 前綴和 / 差分
- 倍增法
進階技巧
---
- 啟發式合併
- hash
- [分塊 + 莫隊](/@gtcoding/H1Y1dl88P)
Data Structure
---
- [STL Container](https://hackmd.io/@konchin/BkGVGVd9I)
- [Binary Indexed Tree(Fenwick Tree)](/@gtcoding/BytWcKhSw)
- Fake Segment Tree
- Sparse Table
- Disjoint Set
- Treap
- 永持久化資料結構
Dynamic Programming
---
Graph Theory
---
- 圖論簡介
### 基礎
- 表示法
- DFS
- BFS
### 最短路徑
- 介紹
- BFS
- Dijkstra
- Bellman-Ford
- Floyd-Warshall
### Tree
- 介紹
- 樹直徑
- [樹重心](/@DiPsY0402/HkMw2NCNw)
- [最近共同祖先(LCA)](/@DiPsY0402/SJbru3ySD)
- 樹序列化
- 樹鏈剖分
### Minimum Spanning Tree
- 介紹
- Kruskal
- Prim
### Bipartite Graph(二分圖)
- 介紹
- [判斷二分圖](/@DiPsY0402/BJifgtt8P)
- 匹配
Math
---
String
---
{"metaMigratedAt":"2023-06-15T13:35:38.609Z","metaMigratedFrom":"YAML","title":"演算法學習共筆","breaks":true,"contributors":"[{\"id\":\"6587fbcb-5744-488e-ac7d-8d93a89a11f4\",\"add\":196,\"del\":120},{\"id\":\"a9413748-c77a-47dd-832f-921213850277\",\"add\":811,\"del\":110},{\"id\":\"e8edfe24-eef8-448f-beff-2798a40d21cd\",\"add\":41,\"del\":2}]"}