國立高雄大學應用數學系 Class Code: AMC621 Instructor: Huilan Chang

<aside> ⭐

公告

• Textbook: https://www.cs.mcgill.ca/~akroit/math/compsci/Cormen Introduction to Algorithms.pdf </aside>

Grading Policy∶

<aside> 💡

Test I (20%): 10/5　1hr

Midterm (30%): 11/2 2hrs

Test II (20%): 11/30 1hr

Final Exam (30%): 12/28 2hrs

1/4 第７節取回期末考考卷

</aside>

Handouts:

<aside>

**Programming: https://drive.google.com/drive/folders/18N65S3WPUFD6nAasfulbEaice95rd91w?usp=sharing**

</aside>

Unit 1 Algorithms: Efficiency, Analysis, and Order

Unit 2 Order

Unit 3 Divide and Conquer Approach: Merge sort and Quick sort

Unit 4 Divide-and-conquer: Strassen’s matrix multiplication algorithm

Unit 5 Heap sort

Unit 6 Computational Complexity of Sorting Problem and Sorting in Linear Time

Unit 7 Sorting in Linear Time: Radix sort and Bucket sort

Unit 8 Dynamic Programming: Chained Matrix Multiplication

Unit 9 Dynamic Programming: Optimal Binary Search Trees

Unit 10 The Greedy Approach: The Activity-selection Problem