教學內容 |
1. Introduction 2. Complexity of Algorithm 3. Divide and Conquer 4. Dynamic Programming 5. Greedy Method 6. Graph Problems 7. General Path Problems 8. NP-Complete 9. Approximation (option) |
Syllabus |
1. Introduction 2. Complexity of Algorithm 3. Divide and Conquer 4. Dynamic Programming 5. Greedy Method 6. Graph Problems 7. General Path Problems 8. NP-Complete 9. Approximation (option) |