Chevron Left
Divide and Conquer, Sorting and Searching, and Randomized Algorithms(으)로 돌아가기

스탠퍼드 대학교의 Divide and Conquer, Sorting and Searching, and Randomized Algorithms 학습자 리뷰 및 피드백

4,527개의 평가
880개의 리뷰

강좌 소개

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

최상위 리뷰

2018년 9월 13일

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.

2020년 5월 26일

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

필터링 기준:

Divide and Conquer, Sorting and Searching, and Randomized Algorithms의 860개 리뷰 중 701~725

교육 기관: Ruining Z

2018년 3월 14일


교육 기관: Дубейковский А А

2020년 8월 18일


교육 기관: Surjya N R

2020년 2월 24일


교육 기관: 林锦坚

2019년 12월 3일


교육 기관: Jingyuan W

2019년 11월 12일


교육 기관: Abhijay M

2019년 8월 11일


교육 기관: Pratik T

2019년 7월 4일


교육 기관: CarlosTsui

2017년 7월 13일


교육 기관: Juspreet S

2016년 10월 30일


교육 기관: Zhang T

2021년 2월 8일


교육 기관: Pranaya R

2020년 9월 10일


교육 기관: 이민준

2020년 7월 4일


교육 기관: XIANG Z

2020년 7월 4일


교육 기관: lokesh v

2019년 9월 25일


교육 기관: Avadhesh Y

2019년 9월 14일


교육 기관: Siddhant K

2017년 6월 3일


교육 기관: 何浩源

2019년 7월 19일


교육 기관: Julia

2018년 6월 2일


교육 기관: Xie R

2019년 2월 10일

교육 기관: Denny K

2019년 1월 14일

I'll give this course four stars.

I think if you want to know about how good this course is, you can check the other reviews. I'm not trying to be picky, just want to brief out that there is something needs to be improved.

This course has been launched for a while, it'll be great if we can improve it, and I sincerely believe this kind of knowledge should be shared with more people who interested in computer science.

To be honest, maybe it's because of my first language is not English, I felt frustrated from time to time. That doesn't mean the material wasn't good, what I learned from this course is quite amazing, the explanation sometimes is just obscured. I knew even the idea behind the algorithm or analysis aren't easy to understand, but what I feel is the professor assume you know everything he's talking about, and the whole sentence become very long.. long enough to let student cannot focus on the idea itself.

If professor can try to explain idea in more plain and easy to understand words, this will be 5 stars recommendation. Content is great, quiz and assignment is challenging enough to bring you lots of fun. If professor can improve that small pieces I mentioned, it'll enhance the overall efficiency of learning.

Anyway, thank you for providing us a such good course.

교육 기관: Tahmid C

2021년 4월 1일

Overall a decent course. The mathematical proofs can be rigorous at times. The programming assignments can be challenging because the instructor tries not to hold your hand through the process. My main issue with the course is the structure. Sometimes topics don't seem to be in a logical order for the best learning experience. Also, the course really expects you to understand lists and reading from text files in order to complete week 4's programming assignment. What should have taken maybe an hour, took me almost 3-4 hours. In my opinion, the Princeton Algorithms course is better. It is structured better and it can be clearly seen that more time was taken to design the course. Their auto-grader is phenomenal. I would recommend it over this course.

교육 기관: SERGEJS I

2019년 8월 31일

I think the course is nice, I have finally understood what the divide and conquer algos are. I like the algo's non-mathematical analysis.

However, I think that the course was overfilled with the complex math which explained significantly worse than actual algos. I like math a lot (my favourite subject), but then the course description should tell about that course contains advanced math, because it is not suitable for everyone.

I also think that a technical task on a quick sort was confusing, it was very difficult to provide a correct answer though the task was simple. I did not like the technical task for the min cut problem. This algorithm available everywhere online, and you must use the pseudo code to implement it (I have not learnt much).

교육 기관: Chao G

2016년 12월 27일

I would recommend this course to anyone who has some experience with coding, but has not taken an algorithm course. I particularly like this course because it is more "math-heavy" than some of the other courses. After taking this course, you might not be able to solve all Leetcode problems (so probably will not help with your interviews directly), but from an intellectual point of view, I think the instructor does a good job explaining why people care about algorithms and how to analyze a class of algorithms rigorously.

교육 기관: Fanghu D

2016년 11월 25일

The unique value of taking the course: read and think through the material with guidance and completing its assignments is the efficiency by saving all the search cost would I collect on my own the good and succinct presentation of the knowledge and exercises with solutions (at least correctness checks.) The entire detail of an algorithm is hard to keep afresh in memory and one needs to refresh it from time to time. It is very cost-effective to take a course like this to accelerate the refresh.

교육 기관: Neeladree C

2017년 6월 27일

Thanks a lot sir ! Learnt a lot of new things in this course. Although, I was a little familiar with the course materials beforehand, there were some mathematical nuances that I was unaware of and now I am ! Your way of explaining things, I guess, is what keeps people glued to the course. Also, the assignments are pretty good. However, I do wish the Final Exam to be a little more difficult. Currently as it is, most of it is merely a revision of past assignments. Thanks !