Update README.md

UMC-KU · Mar 26, 2022 · 4b603a3 · 4b603a3
1 parent 0aad579
commit 4b603a3
Showing 1 changed file with 15 additions and 15 deletions.
diff --git a/README.md b/README.md
@@ -27,22 +27,22 @@
 | :--: | :--------------------------: | :-----------------: | :------:  | :---------:  | :------: |
 | 00 | Data Structure | 자료구조 | [바로가기](./data_structure) | 16 | 25 |
 | 01 | Data Structure 2 | 자료구조 2 | [바로가기](./data_structure2) | 11 | 21 |
-| 02 | Tree | 트리 | [바로가기](./tree) | 15 | 44 |
-| 03 | Math | 수학 | [바로가기](./math) | 18 | 29 |
-| 04 | Greedy | 탐욕법 | [바로가기](./greedy) | 27 | 62 |
-| 05 | Dynamic Programming 1 | 동적계획법 1 | [바로가기](./dynamic_programming_1) | 27 | 80 |
-| 06 | Dynamic Programming 2 | 동적계획법 2 | [바로가기](./dynamic_programming_2) | 28 | 81 |
-| 07 | Two Pointer | 투 포인터 | [바로가기](./two_pointer) | 13 | 36 |
-| 08 | Implementation | 구현 | [바로가기](./implementation) | 30 | 51 |
-| 09 | Graph Traversal | 그래프 탐색 | [바로가기](./graph_traversal) | 31 | 96 |
-| 10 | Brute Force | 완전탐색 | [바로가기](./brute_force) | 33 | 94 |
-| 11 | Simulation | 시뮬레이션 | [바로가기](./simulation) | 30 | 48 |
-| 12 | Binary Search | 이분탐색 | [바로가기](./binary_search) | 20 | 66 |
-| 13 | Backtracking | 백트래킹 | [바로가기](./backtracking) | 28 | 75 |
+| 02 | Math | 수학 | [바로가기](./math) | 18 | 29 |
+| 03 | String | 문자열 | [바로가기](./string) | 19 | 64 |
+| 04 | Brute Force | 완전탐색 | [바로가기](./brute_force) | 33 | 94 |
+| 05 | Implementation | 구현 | [바로가기](./implementation) | 30 | 51 |
+| 06 | Simulation | 시뮬레이션 | [바로가기](./simulation) | 30 | 48 |
+| 07 | Tree | 트리 | [바로가기](./tree) | 15 | 44 |
+| 08 | Greedy | 탐욕법 | [바로가기](./greedy) | 27 | 62 |
+| 09 | Dynamic Programming 1 | 동적계획법 1 | [바로가기](./dynamic_programming_1) | 27 | 80 |
+| 10 | Backtracking | 백트래킹 | [바로가기](./backtracking) | 28 | 75 |
+| 11 | Dynamic Programming 2 | 동적계획법 2 | [바로가기](./dynamic_programming_2) | 28 | 81 |
+| 12 | Graph Traversal | 그래프 탐색 | [바로가기](./graph_traversal) | 31 | 96 |
+| 13 | Binary Search | 이분탐색 | [바로가기](./binary_search) | 20 | 66 |
 | 14 | Divide and conquer | 분할정복 | [바로가기](./divide_and_conquer) | 08 | 18 |
-| 15 | Prefix Sum | 누적 합 | [바로가기](./prefix_sum) | 11 | 32 |
-| 16 | String | 문자열 | [바로가기](./string) | 19 | 64 |
-| 17 | Shortest Path | 최단거리 | [바로가기](./shortest_path) | 18 | 53 |
+| 15 | Shortest Path | 최단거리 | [바로가기](./shortest_path) | 18 | 53 |
+| 16 | Two Pointer | 투 포인터 | [바로가기](./two_pointer) | 13 | 36 |
+| 17 | Prefix Sum | 누적 합 | [바로가기](./prefix_sum) | 11 | 32 |
 | 18 | Topological Sorting | 위상정렬 | [바로가기](./topological_sorting) | 05 | 14 |
 | 19 | Disjoint Set | 분리 집합 | [바로가기](./disjoint_set) | 06 | 20 |
 | 20 | Minimum Spanning Tree(MST) | 최소 스패닝 트리 | [바로가기](./minimum_spanning_tree) | 08 | 24 |