2020. 04. 12. Updated curriculum

Author: 365kim

README.md

@@ -5,20 +5,31 @@
 ---
 
 ### :memo: Definition
-- 데이터를 효율적으로 이용할 수 있도록 컴퓨터에 저장하는 방법
+- `자료구조` : 데이터를 효율적으로 이용할 수 있도록 컴퓨터에 저장하는 방법
 - 데이터의 특성에 따라 분류하여 구성하고 저장 및 처리하는 모든 작업을 의미
 - 데이터 처리의 성능과 효율에 직접적으로 영향을 끼치기 때문에 실제 데이터들의 관계를 잘 반영해야 함
 - `알고리즘` : 자료구조로 표현된 데이터들을 처리하는 절차
 ---
 
+
 ### :memo: Contents
-[**1. linked list**](/1_linked_list)	*(2020 . 03 .02. ~ 03. 08.)* <br>
-[**2. stack**](/2_stack)				*(2020. 03. 09. ~ 03. 22.)* <br>
-[**3. queue**](/3_queue)				*(2020. 03. 23. ~ 03. 29.)* <br>
-[**4. deque**](/4_deque)				*(2020. 03. 30. ~ 04. 05.)* <br>
-[**5. tree**](/5_tree) 					*(2020. 04. 06. ~ 04. 19.)* <br>
-6. priority queue			*(2020. 04. 20. ~ 04. 26.)* <br>
-7. sort						*(2020. 04. 27. ~ 05. 03.)* <br>
-8. hase						*(2020. 05. 04. ~ 05. 10.)* <br>
-9. graph					*(2020. 05. 11. ~ 05. 17.)* <br>
+- Curriculum designed by [**nadarm**](https://github.com/nadarm/42-algorithm)
 
+| No. | Topic | Subopics | Schedule | 
+|:---:|:---|:---|:---|
+| 01 | [__Linked List__](/1_linked_list) | [__1)__ ](/1_linked_list/1_singly_linked_list)singly linked list [__2)__ ](/1_linked_list/2_doubly_linked_list)doubly linked list [__3)__ ](/1_linked_list/3_circular_linked_list)circular linked list | *2020 . 03 .02. ~ 03. 08.*  | 
+| 02 | [__Stack__](/2_stack) | [__1)__ ](/2_stack/1_stack_using_array)using array [__2)__ ](/2_stack/2_stack_using_linked_list)using linked list |	*2020. 03. 09. ~ 03. 22.* |
+| 03 | [__Queue__](/3_queue) | [__1)__ ](/3_queue/1_queue_using_array)using array [__2)__ ](/2_queue/2_queue_using_linked_list)using linked list	| *2020. 03. 23. ~ 03. 29.*
+| 04 | [__Deque__](/4_deque) | [__1)__ ](/4_deque/1_deque_using_linked_list)using linked list	| *2020. 03. 30. ~ 04. 05.*
+| 05 | [__Tree__](/5_tree) | [__1)__ ](/5_tree/1_binary_search_tree)binary search tree [__2)__ ](/5_tree/2_binary_heap)heap(priority queue) [__3)__ ](/5_tree/3_trie)trie <br> [__4)__ ](/5_tree/4_union_ind)union-find(disjoint set) |	*2020. 04. 06. ~ 04. 26.*
+| 06 | Sort  | closed |	*2020. 04. 27. ~ 05. 03.* |
+| 07 | Hash  | closed |*2020. 05. 04. ~ 05. 10.* |
+| 08 | Graph(shortest path)	| closed |	*2020. 05. 11. ~ 05. 17.* |
+| 09 | Graph(MST) | closed |	*2020. 05. 18. ~ 05. 24.* |
+|||||
+| 10 | Brute-Force(DFS, BFS) | closed |	*2020. 05. 25. ~ 05. 31.* |
+| 11 | Dynamic Programming  | closed |	*2020. 06. 01. ~ 06. 07.* |
+| 12 | Greedy Algorithm | closed |	*2020. 06. 08. ~ 06. 14.* |
+| 13 | Divide and Conquer | closed |	*2020. 06. 15. ~ 06. 21.* |
+| 14 | binary search  | closed |	*2020. 06. 22. ~ 06. 28.* |
+| 15 | KMP  | closed |	*2020. 06. 29. ~ 07. 05.* |