此课程适用人群: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.


制作方:   Stanford University

基本信息
24专项课程中 Algorithms/ 的课程
级别Intermediate
承诺学习时间4 weeks of study, 4-8 hours/week
语言
English
如何通过通过所有计分作业以完成课程。
用户评分
4.8 stars
Average User Rating 4.8查看学生的留言
授课大纲

常见问题解答
运作方式
课程作业
课程作业

每门课程都像是一本互动的教科书,具有预先录制的视频、测验和项目。

来自同学的帮助
来自同学的帮助

与其他成千上万的学生相联系,对想法进行辩论,讨论课程材料,并寻求帮助来掌握概念。

证书
证书

获得正式认证的作业,并与朋友、同事和雇主分享您的成功。

制作方
Stanford University
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.
价格
旁听购买课程
访问课程材料

可用

可用

访问评分的材料

不可用

可用

收到最终成绩

不可用

可用

获得可共享的证书

不可用

可用

评分和审阅
已评分 4.8,总共 5 个 134 评分

This was another good one, providing a slightly deeper dive than I had seen in other courses. The big revelation here, for me, was the addition of Bellman-Ford algorithm for evaluating shortest path in networks (graphs) that have some negative distance values between nodes.

I also like the approach to data structures (high-level, then drilling down into increasing detail for level of interest) I find it hard to say I understand a data structure based on "Interface and Theory" and I would have felt the certification meant more with at least a rudimentary implementation. I guess that makes me a coder at at heart.

I am about to jump into the next course of the specialization: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming As with the two courses before, I am expecting new revelations about the kind of programming issues I've been solving for more than fifteen years.

A really good course

Useful refresher!

I learned a lot lot lot, no more to say. Fantastic.