Back to Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Learner Reviews & Feedback for Divide and Conquer, Sorting and Searching, and Randomized Algorithms by Stanford University
5,313 ratings
About the Course
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).
Top reviews
VP
Apr 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
MA
Jun 22, 2020
I found the course's material quite challenging and mathematically rigorous. I really enjoyed the lectures and programming assignments. Now I'm starting with the second course of the series.
Filter by: