Chevron Left
Retour à Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Avis et commentaires pour d'étudiants pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms par Université de Stanford

4.8
étoiles
4,204 évaluations
790 avis

À propos du cours

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)....

Meilleurs avis

KS

Sep 14, 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 27, 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

Filtrer par :

701 - 725 sur 770 Avis pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms

par LAWRENCE S

Jun 28, 2019

The talking speed of instructor is too fast. Is there a way to slow down via the control?

par chandan k s

May 05, 2020

instructor speed of telling the concept is very fast so kindly please take care of it.

par Shubham r

Aug 24, 2019

It was a great course and I loved joining this. Clearing my many theoretical concepts.

par Rui Z

Jan 12, 2019

Very good course! Clear explanations and proofs to help you understand the algorithms.

par Priyanshu J

Apr 04, 2020

I would appreciate if implementation of algorithms is also included with this course.

par Rohan K

Sep 12, 2020

The instructor was really really fast. Grasping the concepts was a little difficult.

par Joey

Jul 02, 2020

Awesome course, I found it very helpful in preparation for my developer interviews.

par Nikhil S

Dec 21, 2019

In the very end, it was fun coding the min-cut algorithm and overall I enjoyed this

par Tianyi Z

Jul 16, 2018

Quicksort could be better. The comparison counting is not a good assignment I feel.

par Lucas P

Jan 01, 2019

The classes are very good but I hope they can improve the programming assignments.

par Sukhesh B

Nov 14, 2016

Great course to improve your skills on Algorithms, Space and Time complexities

par Sriram R

Nov 13, 2016

Needs hands-on experience with high-school probability to help crack the exams

par Aman S

Apr 03, 2020

The instructor wasn't very good at teaching, but the course is designed well.

par Ashish U

Jul 25, 2019

really helpful course on building concepts on data structures and algorithms

par Aditya K

Jun 29, 2018

Tough one, but if you take time to understand ... it is deep and fun as well

par Yusuf K

Jan 20, 2018

Excellent set of tutorials. Good questions that require critical thinking.

par adham E

Jun 03, 2020

I thin it can be more easier as its first course in the specialization

par Dharmesh

Apr 07, 2020

Very good, Assignment and Quiz. It's help me lot of to clear Concept.

par Fatoumata F

Apr 23, 2018

I loved the problem set 1!

Thanks for the book recommendations also

par Hassan N

Mar 01, 2017

Great course but audio and video are terribly out of sync.

par Giorgi G

Nov 13, 2018

Retake videos, because it's hard to watching handwriting.

par sherif s

Nov 15, 2019

over all is good

the proofs parts are too much by the way

par Vishnu

Dec 31, 2019

Sometimes it became complicated but it was really good

par Yang W

May 10, 2018

very conceptual, not very friendly to the beginner.

par Utsav S

Jun 04, 2020

excellent ,what i most need was asymptotic analysis