From 292e31bd8d8e3ee824f9c6d471a48c6d41956225 Mon Sep 17 00:00:00 2001
From: LU <hit_lu@foxmail.com>
Date: Tue, 3 Jun 2025 16:38:11 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BF=AE=E6=94=B9=E5=B8=B8=E7=94=A8=E6=A8=A1?=
 =?UTF-8?q?=E6=9D=BF=E7=AE=97=E6=B3=95=E8=AF=B4=E6=98=8E?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 readme.md | 41 +++++++++++++++--------------------------
 1 file changed, 15 insertions(+), 26 deletions(-)

diff --git a/readme.md b/readme.md
index ad03414..019975a 100644
--- a/readme.md
+++ b/readme.md
@@ -1,27 +1,16 @@
-##
+**C++ 常用算法模板**
 
-**binary search**
-
-**union-find sets**
-
-**topological sorting**
-
-**knuth-morris-pratt**
-
-**dijsktra**
-
-**bipartite graph**
-
-**math**: quickpow, prime judging, greatest common divisor
-
-**binary indexed tree**
-
-**minimum spanning tree**: krukal  / prime
-
-**segment tree**
-
-**binary search tree & AVL tree**
-
-**trie tree**
-
-**k-d tree**
\ No newline at end of file
+| 类型      | 文件名 |    描述     |
+| ----------- | ----------- | ----------- |
+| 二分查找 | binary search | — |
+| 并查集   | union-find sets | 处理一些不相交集合的合并及查询问题 |
+| 拓扑排序 | topological sorting | — |
+| KMP算法 | knuth-morris-pratt | 快速的字符串匹配算法 |
+| Dijsktra | dijsktra | — |
+| 数学方法 | math | 含 quickpow, prime judging, greatest common divisor 等方法|
+| 线段树 | segment tree | — |
+| 树状数组 | binary indexed tree | 用于高效计算数列的前缀和， 区间和 |
+| 最小生成树 | minimum spanning tree | krukal  / prime |
+| 二叉搜索树/平衡树 | binary search tree & AVL tree | — |
+| 字典树 | trie tree| — |
+| K-D树 | k-d tree | — |
\ No newline at end of file