HW1: insertion sort and merge sort
HW2: heap sort and find maximum sub-array
HW3: longest-common-subsequence(LCS) problem and matrix-chain multiplication problem
HW4: activity-selection problem and fractional knapsack problem
HW5: Dijkstra and Bellman-Ford alg with adjacency matrix
Course Outline: http://timetable.nctu.edu.tw/?r=main/crsoutline&Acy=107&Sem=2&CrsNo=5398&lang=zh-tw
Reference: