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: Data Structures
Status: Computational Thinking
IntermediateSpecialization

Top reviews across Algorithms

Reviewed Mar 20, 2022
Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms

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.

Reviewed Mar 29, 2020
Course: Graph Search, Shortest Paths, and Data Structures

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.

Reviewed Jan 25, 2023
Course: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Good course, though I posted a couple of questions in the forums and I am still waiting for an answer from one of the mentors.

Reviewed May 1, 2018
Course: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

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

Reviewed Jun 10, 2017
Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms

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.

Reviewed Nov 30, 2019
Course: Graph Search, Shortest Paths, and Data Structures

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.

Reviewed Dec 30, 2020
Course: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

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!

Reviewed Jul 6, 2018
Course: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

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

Reviewed Dec 2, 2022
Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms

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

Reviewed Oct 30, 2021
Course: Graph Search, Shortest Paths, and Data Structures

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.

Reviewed Jan 13, 2018
Course: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

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

Reviewed Aug 22, 2018
Course: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

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.

Learner reviews across Algorithms

Showing: 20 of 1,022

Thomas
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Feb 9, 2019Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Divij
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Jan 23, 2018Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Ian
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Jan 3, 2019Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Erin
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Jun 19, 2018Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Josh
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Oct 3, 2018Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Bharath
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Oct 16, 2018Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Bakhtiar
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Nov 3, 2017Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
amit
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Nov 2, 2016Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Pablo
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Dec 30, 2019Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Jyovita
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Jun 11, 2017Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Maxim
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Apr 9, 2021Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Luiz
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Oct 1, 2019Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Faiz
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Mar 16, 2017Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Vladimir
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Oct 18, 2019Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Moushumi
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed May 25, 2021Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Wang
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Dec 13, 2020Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Pulkit
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Jun 11, 2018Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Matthieu
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Sep 13, 2018Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Adam
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Jun 11, 2017Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Cole
Course: Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsReviewed Jan 14, 2021Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms