Algorithm Lecture 2023
- [9/4] Chapter 1 : 알고리즘의 첫걸음
- [9/5] Chapter 2 : 알고리즘을 배우기 위한 준비
- [9/11] Python Basic 1 : Keywords, Collections - p02 Dictionary 까지 진행.
- [9/12] Python Basic 2 : Module, Libraries
- [9/18] Ch 6 Sort #1 : Bubble, Selection, Insert, Shell
- [9/19] Ch 6 Sort #2 : 실습
- [9/25] Ch 6 Sort #3 : Heap, Radix, External
- [9/26] Ch 6 Sort #4 : 실습
- [10/2] Ch 3 D&C #1 : Merge, Quick
- [10/3] Ch 3 D&C #2 : 실습
- [10/9] Ch 3 D&C #3 : 다양한 언어에서의 Sort
- [10/10] Ch 3 D&C #4 : Selection, Closest Pair
- [10/16] Ch 3 D&C #5 : 실습
- [10/17] 중간고사 대비 정리
- 중간고사
- Ch 4 Greedy #1 : Coin, MST
- Ch 4 Greedy #2 : Kruskal, Prim
- Ch 4 Greedy #3 : 실습
- Ch 4 Greedy #4 : Dijkstra, Knapsack, ...
- Ch 4 Greedy #5 : Set-Cover, Floyd-Warshall
- Ch 5 DyPrg #1 : Matrix, 0-1 Knapsack, Coin Change
- Ch 5 DyPrg #2 : 실습
- Ch 7 NP-Complete
- Ch 8 Approx. Algo. #1 : PPT
- Ch 8 Approx. Algo. #2 : 실습: MST-TSP
- Ch 8 Approx. Algo. #3 : 실습: VertexCover, BinPacking
- Ch 8 Approx. Algo. #4 : 실습: Clustering
- 기말고사 대비 정리
- 기말고사