返回到 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
学生对 Stanford University 提供的 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的评价和反馈
1,275 个评分
课程概述
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
热门审阅
SC
Dec 30, 2020
Best (not one of the best) course available on web to learn theoretical algorithms. You will love it. Enjoy new journey and perspect to view and analyze algorithms. Loved it damn!
SC
Sep 22, 2017
A more explanatory answer sheet would be helpful. Might need to be secured via limited time login session to avoid leaking on the web.
筛选依据：