選課的選項

課程大綱(Course Outline)

1. Introduction: Basic concepts of algorithms
2. Mathematical Background: Growth of functions, recurrences, master theorem, discrete mathematics, probability analysis
3. Sorting: Heapsort, Quicksort, Bucket Sort, etc.
4. Data structures
5. Design & analysis techniques: dynamic programming, greedy algorithms, amortized analysis, etc.
6. Advanced data structures
7. Graph algorithms
8. NP-completeness

如有其他疑問或是旁聽需求請寄信至助教email: kyp113@beethoven.ee.ncku.edu.tw
訪客無法存取這一課程,請登入。