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).
This course is part of the Algorithms Specialization
About this Course
Skills you will gain
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
Syllabus - What you will learn from this course
- 5 stars83.06%
- 4 stars13.66%
- 3 stars1.80%
- 2 stars0.57%
- 1 star0.89%
TOP REVIEWS FROM DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
very intansive ,it has really challenged my knowledge level both in english language or in computational mathematics,i feel too configent now.thank Stanford University,thanks Coursera
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.
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
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
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.