# 算法筆記
### 前言
- [前言](README.md)
### Part 1:入門篇
- [第一章:概述](ch01/README.md)
- [算法初步](ch01/basic-arithmetric.md)
- [第二章:算法初步](ch02/README.md)
* [排序](ch02/sort.md)
- [散列](ch02/hash-table.md)
- [貪心](ch02/greedy.md)
- [二分](ch02/binary.md)
- [其他高效技巧](ch02/hight-efficiency-tip.md)
- [第三章:數學問題](ch03/README.md)
* [分數計算與大整數計算](ch03/calculation.md)
* [最大公約數與最小公倍數](ch03/gcf.md)
* [質數及其應用](ch03/prime-number.md)
* [組合數](ch03/combination-number.md)
### Part2:提高篇
- [第四章:線性數據結構](ch04/README.md)
- [棧](ch04/stack.md)
- [深度優先搜索](ch04/dfs.md)
- [隊](ch04.queue.md)
- [廣度優先搜索](ch04/bfs.md)
- [順序表](ch04/list.md)
- [數組和稀疏矩陣](ch04/array-and-matrix.md)
- [第五章:樹結構](ch05/README.md)
- [樹與二叉樹](ch05/tree-and-bt.md)
- [二叉樹遍歷](ch05/bt-traversal.md)
- [線索二叉樹](ch05/threaded-bt.md)
- [樹遍歷](ch05/tree-traversal.md)
- [查找二叉樹](ch05/bst.md)
- [平衡二叉樹](ch05/avl-tree.md)
- [并查集](ch05/disjoint-set.md)
- [堆](ch05/heap.md)
- [哈弗曼樹](ch05/huffman-tree.md)
- [第六章:圖](ch06/README.md)
- [圖的概念](ch06/graph.md)
- [圖的遍歷](ch06/graph-traversal.md)
- [最短路徑](ch06/shortest-path.md)
- [最小生成樹](ch06/minimum-spanning-tree.md)
- [AOV 網與拓撲排序](ch06/topological-sorting.md)
- [ AOE 網與關鍵路徑](ch06/critical-path.md)
- [第七章:動態規劃](ch07/README.md)
- [第八章:字符串](ch08/README.md)
### Part3:拓展篇
- [分塊思想]()
- [樹狀數組]()