| 課程目標 |
主要探討排序、遞迴、動態規劃、貪婪演算法、... 等等問題，同時也延續資料結構的課程，探討運作於平衡樹及圖等進階資料結構的演算法，如尋訪、最短路徑等等。教學內容包括 1. 演算法概論 2. Divide-and-Conquer 3. 動態規劃 4. 貪婪演算法 5. 回溯 6. Branch-and-Bound 7. 複雜度計算 8. NP Theory。 |
Objectives |
In this course, we study methods for sorting, recursion, dynamic programming, greedy algorithms, ...etc. In continuation of the data structures course, we also study algorithms for balanced trees and graphs. The contents of the course are as follows: 1.Introduction 2.Divide-and-Conquer 3.Dynamic Programming 4.Greedy Algorithm 5.Backtracking 6.Branch-and-Bound 7.Complexity Computation 8.NP Theory. |