Chevron Left
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

4.8
stars
5,259 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 - 1006 of 1,006 Reviews for Divide and Conquer, Sorting and Searching, and Randomized Algorithms

By Vemula R

•

Mar 10, 2022

CODE ALSO NEEDS TO BE TAUGHT. ONLY ALGO WAS GIVEN

By Aryaman B

•

Jul 10, 2024

The content is good, but what is the point of having problem sets when you do not even show the solutions to it. How would a student work through if they get stuck at a question in the problem set. Some other courses from Stanford, such as the Introduction to Mathematical Thinking include solved answers to problem set questions in the lecture videos unlike this one. Highly disappointing.

By مكاريوس س ي

•

Dec 25, 2023

انا افهم الكورس بالكاد بسبب اني درست تلك المعلومات من قبل لكن شرح الاستاذ معقد للغاية ولا يناسب اغلب الطلاب

By Qian B

•

May 31, 2023

I have done the homework. However, I need a supercomputer to do you calc. I'd like to exit.

By Samuel H

•

Dec 17, 2024

quizzes are broken. course is no longer supported.

By Huy H Đ

•

Feb 15, 2024

each video is too long