About this Specialization

85,749 recent views
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.
Learner Career Outcomes
62%
Started a new career after completing this specialization.
20%
Got a pay increase or promotion.
Shareable Certificate
Earn a Certificate upon completion
100% online courses
Start instantly and learn at your own schedule.
Flexible Schedule
Set and maintain flexible deadlines.
Intermediate Level
Approx. 4 months to complete
Suggested 4 hours/week
English
Learner Career Outcomes
62%
Started a new career after completing this specialization.
20%
Got a pay increase or promotion.
Shareable Certificate
Earn a Certificate upon completion
100% online courses
Start instantly and learn at your own schedule.
Flexible Schedule
Set and maintain flexible deadlines.
Intermediate Level
Approx. 4 months to complete
Suggested 4 hours/week
English

There are 4 Courses in this Specialization

Course1

Course 1

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

4.8
stars
4,260 ratings
802 reviews
Course2

Course 2

Graph Search, Shortest Paths, and Data Structures

4.8
stars
1,722 ratings
202 reviews
Course3

Course 3

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

4.8
stars
1,076 ratings
125 reviews
Course4

Course 4

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

4.8
stars
689 ratings
93 reviews

Offered by

Placeholder

Stanford University

Frequently Asked Questions

More questions? Visit the Learner Help Center.