98年第1學期-8114 演算法則 課程資訊
1.Provide experience in rigorous analysis of algorithm complexity.
2.Provide an introduction to algorithms for hard problems, including optimization and probabilistic algorithms.
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and divide-and-conquer; dynamic programming; graph algorithms; shortest paths. To show not only how to solve particular problems, but also how to solve new problems when they arise in the future.