# 算法笔记 ### 前言 - [前言](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:拓展篇 - [分块思想]() - [树状数组]()