Who is this class for: 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.


Created by:   Stanford University

Basic Info
Course 2 of 4 in the Algorithms Specialization.
LevelIntermediate
Commitment4 weeks of study, 4-8 hours/week
Language
English
How To PassPass all graded assignments to complete the course.
User Ratings
4.8 stars
Average User Rating 4.8See what learners said
Syllabus

FAQs
How It Works
Coursework
Coursework

Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.

Help from Your Peers
Help from Your Peers

Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.

Certificates
Certificates

Earn official recognition for your work, and share your success with friends, colleagues, and employers.

Creators
Stanford University
Pricing
AuditPurchase Course
Access to Course Materials

Available

Available

Access to Graded Materials

Not available

Available

Receive a Final Grade

Not available

Available

Earn a Shareable Certificate

Not available

Available

Ratings and Reviews
Rated 4.8 out of 5 of 112 ratings

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.