一、課程說明(Course Desc<x>ription)
<br>先修：資料結構, 離散樹學
<br>目的：Introduction to Algorithms
<br>學生使用 AI 的規則: 本課程無涉及AI使用
<br>大網：
<br>        
<br>
<br>I  Foundations
<br>1. 	The role of Algorithms in Computing
<br>2. 	Getting Started
<br>3. 	Growth of Functions
<br>4. 	Divide-and-Conquer
<br>
<br>II  Sorting and Order Statistics
<br>6.	Heapsort
<br>7.	Quicksort
<br>8.	Sorting in Linear Time
<br>9.	Medians and Order Statistics
<br>
<br>IV  Advanced Design and Analysis Techniques
<br>15.	Dynamic Programming
<br>16.	Greedy Algorithms
<br>17.	Amortized Analysis
<br>
<br>V  Advanced Data Structures
<br>21.	Data Structures for Disjoint Sets
<br>
<br> 
<br>VI  Graph Algorithms
<br>22.	Elementary Graph Algorithms
<br>23.	Minimum Spanning Trees
<br>24.	Single-Source Shortest Paths
<br>25.	All-Pairs Shortest Paths
<br>26.	Maximum Flow
<br>
<br>VII Selected Topics
<br>31.	Number-Theoretic Algorithms
<br>33.	Computational Geometry
<br>34.	NP-Completeness
<br>35.	Approximation Algorithms
<br>
<br>
<br>Self-educated: Chapters 10~12, 18, 30, 32
<br>
<br>
<br>
<br> 二、指定用書(Text Books)
<br>
<br>T. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, 
<br>3rd edition, the MIT press, 2009.
<br>
<br>
<br> 三、參考書籍(References)
<br>
<br>R. C. T. Lee, R. C. Chang, S. S. Tseng, and Y. T. Tsai, Introduction to the 
<br>Design and Analysis of Algorithms, 松崗, 1999.
<br>
<br>
<br>
<br> 四、教學方式(Teaching Method)
<br>
<br>
<br>
<br>
<br> 五、教學進度(Syllabus)
<br>
<br>
<br>
<br>
<br> 六、成績考核(Evaluation)
<br>
<br>作業: 20%
<br>期中考：35％
<br>期末考：45％
<br>
<br>	
<br> 七、可連結之網頁位址
<br>
<br>課程中發給
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>