update: 240602 ver1

V1CeVersaa · Jun 2, 2024 · 5140dd2 · 5140dd2
1 parent 16f949f
commit 5140dd2
Show file tree

Hide file tree

Showing 3 changed files with 12 additions and 1 deletion.
diff --git a/docs/Computer Science/Algorithm/05 Sorting.md b/docs/Computer Science/Algorithm/05 Sorting.md
@@ -12,4 +12,9 @@ void insertSort (int arr[], int len) {
         arr[j] = tmp;
     }
 }
-```
+```
+
+
+## Merge Sort
+
+归并排序的时间复杂度在任何情况下都是 $O(N\log N)$。
diff --git a/docs/Math/Discrete Mathematics/10 Graph Theory.md b/docs/Math/Discrete Mathematics/10 Graph Theory.md
@@ -75,6 +75,8 @@ For $G = (V, E)$ and $H = (W, F)$.
 
 ## 10.3 Representing Graphs and Graph Isomorphism
 
+**Adjacency Matrix**: A simple graph $G = (V, E)$ with $n$ vertices $(v_1,v_2,\cdots, v_n)$ can be represented by its adjacency matrix, A, with respect to this listing of the vertices, where
+
 ## 10.4 Connectivity
 
 ## 10.5 Euler and Hamilton Paths

diff --git a/docs/Varia/Tools.md b/docs/Varia/Tools.md
@@ -0,0 +1,4 @@
+# Tools Using Record
+
+## 1. IDA
+