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.07%
- 4 stars13.64%
- 3 stars1.80%
- 2 stars0.57%
- 1 star0.89%
TOP REVIEWS FROM DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
Since I am relatively new to computer science, this course is a little bit hard.
But, overall it's ok and the course also mentioned the similar material is taken by sophomores, juniors and seniors.
This course was outstanding! Big thanks to Tim for explaining difficult concepts in a clear and concise fashion. I can't wait to get started on the next course in this specialization!
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!
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
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.