國立高雄大學應用數學系
Class Code: AM C623 Instructor: Huilan Chang
<aside> 💡
<aside>
檔名：為主題名稱，例如Medians and Order Statistics.pdf (.pttx …)
軟體：powerpoint, Notion, HackMD, ….
注意：數學符號要打出來: For each $\epsilon>0$, there exists $\delta>0$…. , $\Omega(n^2\log n)$, …
上傳檔案：https://forms.gle/SC5yonSNgZWg8YbJ6
</aside>
Handouts:
<aside>
**Programming: https://drive.google.com/drive/folders/18N65S3WPUFD6nAasfulbEaice95rd91w?usp=sharing**
</aside>
Unit 1 Algorithms: Efficiency, Analysis, and Order
Unit 3 Divide and Conquer Approach: Merge sort and Quick sort
Unit 4 Divide-and-conquer: Strassen’s matrix multiplication algorithm
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
Unit 03 Divide and Conquer.pdf
Unit 6 Computational Complexity of Sorting Problem and Sorting in Linear Time.pdf
Unit 07 Sorting in Linear Time_ Radix sort and Bucket sort.pdf
Unit 08 Dynamic Programming_ Chained Matrix Multiplication.pdf
Unit 9 Dynamic Programming_ Optimal Binary Search Trees.pdf
Unit 10 The Greedy Approach_ The Activity-selection Problem.pdf