Back to Algorithms

Algorithms

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. About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Status: Network Routing
Status: Computer Science
IntermediateSpecialization

Top reviews across Algorithms

CN

Reviewed Mar 20, 2022

Since I am relatively new to computer science, this course is a little bit hard.But, overall it's ok and the course also mentioned the similar material is taken by sophomores, juniors and seniors.

DS

Reviewed Mar 29, 2020

Awesome course! Professor Roughgarden is fantastic. The material was appropriately challenging. Perfect amount of rigor. Only one minor squabble: the hash problem set is terribly misleading.

SC

Reviewed 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!

LC

Reviewed May 1, 2018

Fantastic course by a fantastic Teacher, Prof. Roughgarden manages to turn the dry subject of Algorithms into a hot sexy one!!

JC

Reviewed Jun 10, 2017

A really exciting and challenging course. Loved the way the instructor explained everything with so much detail and precision. Definitely looking forward to the next course in the specialization.

TG

Reviewed Nov 30, 2019

It was an awesome experience to learn from such a teacher. Now I have a much clear view of the graph algorithms. I have enjoyed this course. Thanks to Stanford for offering this course.

JF

Reviewed Jan 13, 2018

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

GB

Reviewed Jul 6, 2018

Excellent course! Bravo to the teacher for the commitment provided in this course. Kind regards.

N

Reviewed Dec 2, 2022

very intansive ,it has really challenged my knowledge level both in english language or in computational mathematics,i feel too configent now.thank Stanford University,thanks Coursera

OK

Reviewed Oct 30, 2021

The course was very interesting. As a person who struggles with problem-solving, I found this course very helpful because the professor's ideas are well explained. It makes me to learn more.

YL

Reviewed Nov 26, 2018

Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.

AS

Reviewed Aug 22, 2018

This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking. One of the best courses I did on Coursera.