Avis et commentaires pour d'étudiants pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms par Université de Stanford
À propos du cours
Meilleurs avis
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.
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
801 - 825 sur 887 Avis pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms
par Pasha B
•Would be great to have more verbose assignments check results. But still awesome experience and challenge
par Rakibullah S
•Good but some videos on how the algorithms work and the proofs could have been much easier and clearer
par Haoran Z
•Great algorithm course, definitely helps people who find reading an algorithm book too boring to read.
par tanish s
•accent is difficult to understand for indian students. course is very helpful to grab deep knowledge.
par Heather F
•Great course. It would be nice if there was more detailed feedback on the assignments and quizes.
par S A
•Please do not teach graphs before teaching data structures it becomes very tough for students.
par Irene J
•It is a little bit hard for people who only have Python background, but still pretty good.
par LAWRENCE S
•The talking speed of instructor is too fast. Is there a way to slow down via the control?
par Andres M H C
•Very nice course. The professor speak really fast but the subtitles are really helpful
par CHANDAN K S
•instructor speed of telling the concept is very fast so kindly please take care of it.
par Shubham r
•It was a great course and I loved joining this. Clearing my many theoretical concepts.
par Rui Z
•Very good course! Clear explanations and proofs to help you understand the algorithms.
par Priyanshu J
•I would appreciate if implementation of algorithms is also included with this course.
par Rohan K
•The instructor was really really fast. Grasping the concepts was a little difficult.
par Joey
•Awesome course, I found it very helpful in preparation for my developer interviews.
par Nikhil S
•In the very end, it was fun coding the min-cut algorithm and overall I enjoyed this
par Tianyi Z
•Quicksort could be better. The comparison counting is not a good assignment I feel.
par Lucas P
•The classes are very good but I hope they can improve the programming assignments.
par Osmar P
•Extreme well-structured course, but it's really hard to understand the whiteboard
par Dieter V
•Very well explained. Good selection of programming assignments and problem sets.
par Sukhesh B
•Great course to improve your skills on Algorithms, Space and Time complexities
par Sriram R
•Needs hands-on experience with high-school probability to help crack the exams
par Aman S
•The instructor wasn't very good at teaching, but the course is designed well.
par Ashish U
•really helpful course on building concepts on data structures and algorithms
par Aditya K
•Tough one, but if you take time to understand ... it is deep and fun as well
Coursera Footer
