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).
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
- 5 stars86.71%
- 4 stars11.26%
- 3 stars1.68%
- 2 stars0.08%
- 1 star0.25%
来自GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING的热门评论
A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.
One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.
Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.
I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!
关于 算法 专项课程
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.