Best of Coursera
Top Tim Roughgarden Courses

share ›
‹ links

These are the top 4 Tim Roughgarden courses and offerings found from analyzing all discussions on Reddit that mention any Coursera course.

#1
Divide and Conquer, Sorting and Searching, and Randomized Algorithms Course
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and
Stanford University
Tim Roughgarden
1 reddit posts
9 mentions
#2
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming Course
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning
Stanford University
Tim Roughgarden
0 reddit posts
4 mentions
#3
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them Course
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall,
Stanford University
Tim Roughgarden
0 reddit posts
1 mentions
#4
Graph Search, Shortest Paths, and Data Structures Course
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees,
Stanford University
Tim Roughgarden
0 reddit posts
1 mentions