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.
Algorithms Specialization
Discover new skills with $120 off courses from industry experts. Save now.
Algorithms Specialization
Learn To Think Like A Computer Scientist. Master the fundamentals of the design and analysis of algorithms.
Instructor: Tim Roughgarden
125,981 already enrolled
Get in-depth knowledge of a subject
(5,690 reviews)
Intermediate level
Some related experience required
1 month at 10 hours a week
Flexible schedule
Earn a career credential
Share your expertise with employers
Get in-depth knowledge of a subject
(5,690 reviews)
Intermediate level
Some related experience required
1 month at 10 hours a week
Flexible schedule
Earn a career credential
Share your expertise with employers
What you'll learn
What’s included
Shareable certificate
Add to your LinkedIn profile
Taught in English
36 practice exercises
Advance your subject-matter expertise
- Learn in-demand skills from university and industry experts
- Master a subject or tool with hands-on projects
- Develop a deep understanding of key concepts
- Earn a career certificate from Stanford University
Specialization - 4 course series
What you'll learn
Skills you'll gain
Category: Algorithms
Category: Analysis
Category: Probability & Statistics
Category: Graph Theory
Category: Probability
Category: Data Structures
Category: Computer Science
Category: Theoretical Computer Science
Category: Computational Thinking
What you'll learn
Skills you'll gain
Category: Data Structures
Category: Algorithms
Category: Graph Theory
Category: Network Model
Category: Network Routing
Category: Theoretical Computer Science
Category: Computational Thinking
Category: Network Analysis
What you'll learn
Skills you'll gain
Category: Algorithms
Category: Graph Theory
Category: Data Structures
Category: Computational Thinking
Category: Theoretical Computer Science
Category: Bioinformatics
What you'll learn
Skills you'll gain
Category: Algorithms
Category: Graph Theory
Category: Theoretical Computer Science
Category: Design Strategies
Category: Data Structures
Category: Operations Research
Category: Computational Thinking
Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.
Instructor
Offered by
Why people choose Coursera for their career
Felipe M.
Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."
Open new doors with Coursera Plus
Unlimited access to 10,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription
Advance your career with an online degree
Earn a degree from world-class universities - 100% online
Join over 3,400 global companies that choose Coursera for Business
Upskill your employees to excel in the digital economy
Frequently asked questions
The Specialization has four four-week courses, for a total of sixteen weeks.
Learners should know how to program in at least one programming language (like C, Java, or Python); some familiarity with proofs, including proofs by induction and by contradiction; and some discrete probability, like how to compute the probability that a poker hand is a full house. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors.
For best results, the courses should be taken in order.
More questions
Financial aid available,