演算法概論
Introduction to Algorithms
| 節 | 週二 |
|---|---|
3 10:10–11:00 | 演算法概論 EDB27(光復) 2 節連堂 |
4 11:10–12:00 |
* 根據陽明交大上課時間表所列
Introduction to basic algorithm design and analysis methods
Data Structures and Object-Oriented Programming
無備註
教師未提供此項資料
Midterm exam: 25% Final exam: 25% Programming assignments & handwritten assignments: 50%
Sorting and Order Statistics
- Heapsort - Quicksort - Sorting in Linear Time - Medians and Order Statistics
Data Structures
- Hash Tables - Binary Search Trees - Red-Black Trees
Advanced Design and Analysis Techniques
- Dynamic Programming - Greedy Algorithms - Amortized Analysis
Graph Algorithms
- Minimum Spanning Trees - Single-Source Shortest Paths - All-Pairs Shortest Paths
Selected Topics
- NP-Completeness - Approximation Algorithms
Foundations
- Getting Started - Growth of Functions - Divide-and-Conquer - Probabilistic Analysis and Randomized Algorithms
教師未提供此項資料
Cormen, Leiserson, Rivest and Stein, ``Introduction to Algorithms'', 3rd ed, 2009, MIT press.
- 地點
- 教師未提供此項資料
- 時間
- By appointment
- 聯絡方式
- 教師未提供此項資料
