一、課程說明(Course Description)
<br>先修：無
<br>目的：Introduction to Algorithms
<br>大網：
<br>           1. Introduction
<br>　　　I. Mathematical Foundations
<br>           2. Growth of Functions
<br>           3. Summations
<br>           4. Recurrences
<br>      II. Sorting and Order Statistics
<br>           7. Heapsort
<br>           8. Quicksort
<br>           9. Sorting In Linear Time
<br>          10. Medians and Order Statistics
<br>      IV. Advanced Design and Analysis Techniques
<br>          16. Dynamic Programming
<br>          17. Greedy Algorithms
<br>          18. Amortized Analysis
<br>       V. Advanced Data Structures
<br>          20. Binomial Heaps
<br>          21. Fibonacii Heaps
<br>          22. Data Structures for Disjoint Sets
<br>       VI. Graph Algorithms
<br>          23. Elementary Graph Algorithms
<br>          24. Minimum Spanning Trees
<br>          25. Single-Source Shortest Paths
<br>          26. All-Pairs Shortest Paths
<br>          27. Maximin Flow
<br>       VII. Selected Topics
<br>          31. Matrix Operations
<br>          34. String Matching
<br>          36. NP-Completeness
<br>          37. Approximation Algorithms
<br>          **. Branch-and-Bound
<br>       Self-educated: Chapters 11~15, 19 
<br>
<br>
<br>
<br>
<br>
<br> 二、指定用書(Text Books)
<br>
<br>T. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, 2nd edition, the MIT press, 2001.
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br> 三、參考書籍(References)
<br>
<br>R. C. T. Lee, R. C. Chang, S. S. Tseng, and Y. T. Tsai, Introduction to the Design and Analysis of Algorithms, 松崗, 1999.
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br> 四、教學方式(Teaching Method)
<br>
<br>
<br>
<br>
<br> 五、教學進度(Syllabus)
<br>
<br>
<br>
<br>
<br> 六、成績考核(Evaluation)
<br>
<br>作業: 10%
<br>期中考：４０％
<br>期末考：5０％
<br>
<br>
<br>
<br>
<br>
<br>
<br> 七、可連結之網頁位址
<br>
<br>課程中發給
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>