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,244 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
KS
Sep 13, 2018
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.
DT
May 26, 2020
Thank you for teaching me this course. I learned a lot of new things, including Divide-and-Conquer, MergeSort, QuickSort, and Randomization Algorithms, along with proof for their asymptotic runtime
Filter by:
1001 - 1001 of 1,001 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms
By Huy H Đ
•Feb 15, 2024
each video is too long