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).
About this Course
Skills you will gain
- 5 stars83.07%
- 4 stars13.68%
- 3 stars1.82%
- 2 stars0.56%
- 1 star0.86%
TOP REVIEWS FROM DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
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 :-)
A Great course for someone who is a beginner and is really dedicated towards learning Algorithms! I loved the instructor's explanations for the proof of correctness of algorithms.
Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec
Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.
About the Algorithms Specialization
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.