The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
Offered By
Algorithms SpecializationStanford UniversityAbout this Course
133,100 recent views
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 1 of 4 in the
Intermediate Level
Approx. 17 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Skills you will gain
- Algorithms
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 1 of 4 in the
Intermediate Level
Approx. 17 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Offered by
Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Syllabus - What you will learn from this course
4 hours to complete
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
4 hours to complete
13 videos (Total 130 min), 3 readings, 2 quizzes
4 hours to complete
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
4 hours to complete
11 videos (Total 170 min), 2 readings, 2 quizzes
4 hours to complete
Week 3
The QuickSort algorithm and its analysis; probability review.
4 hours to complete
9 videos (Total 156 min), 1 reading, 2 quizzes
5 hours to complete
Week 4
5 hours to complete
11 videos (Total 184 min), 3 readings, 3 quizzes
Reviews
- 5 stars83.24%
- 4 stars13.52%
- 3 stars1.80%
- 2 stars0.53%
- 1 star0.88%
TOP REVIEWS FROM DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
by VPApr 26, 2020
Professor Tim is an amazing instructor, and he explained all those elegant proofs in a brief and concise manner. I really enjoyed this course and certainly felt my IQ level going above roof ! :P
by SNMar 25, 2020
I'm happy with this course because is a little challenging, not like other coursers where there are trivial answers and tests. I feel now much more confident with my fundamentals. Thank you Tim!
by EEJan 26, 2018
It would be great if lectures and slides would be with better design and to make and record new slides and lectures. Because these lectures seems too old. Everything else is great.
by MKSep 14, 2019
This course is awesome and a bit challenging. The special part is about the problem quizzes which is about the running time analyses of the algorithms. And the professor is superb :-)
About the Algorithms Specialization
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.
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.
