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

It would be great if lectures and slides would be with better design and to make and record new slides and lectures. Because these lectures seems too old. Everything else is great.

understand that this is intended to be cross code language information, but would also be nice to see examples of non-pseudo code and implemented into at least one language

Nice material. Wish the instructor can go over some part of the material a little slower. Also it would be nice if the solution of the optional questions can be provided.

Great course for who is seeking to learn new algorithms and their analysis specially the randomized algorithm. but its videos are kind of long compered to other courses.

It would be good to have more simple examples, like how theoretical results can be applied, with exact numbers and not with abstract n, a, k, b, j after we prove them.

Kindly make it more simpler by adding more practise problems so that solving problems become more easier during the test and thereby to gain more knowledge on the same

It would be better to have more test cases linked to programming assengments. Hoppefully, there is a github branch with that already... but better to merge it to here

High rank because the instructor really makes the material come alive. Not a 5-star since I wish there was more supporting materials to accompany the course. Thanks!

Good if you want to be a researcher or follow your career on algorithms but not so good if you want to learn using ds and algos fast to crack technical interviews.

great course but it would be better if you ask students to submit their code and give limits and various test cases like an actual programming contest.

very good teaching of algorithms.however a little help for coding those would be appreciated.(in my case i am dealing with graphs for the first time).

Overall experience is well, the probability overview was fast, require deep understanding with probability and statistics in discrete model.

Content is great. But handwriting is hard to understand clearly for non-native english speakers. I expected good quality of presentations.

excellent course

slightly fast paced and optional exercises are challenging . one should solve those as well to get in depth practice.

Teaching is absolutely perfect. (A grade). But the content in this sub-division of the specialization is very much theoretical.

Course content is satisfyingly rigorous. However, the lack of community support and interaction heavily affects the experience.

Very nice course, but some parts are not clear because the instructor talks really fast and goes over some parts very quickly.

Great course.

Tim Roughgarden is an incredible teacher.

You'll learn more using Tim's books on the subject, by the way.

Good explanations, but more theoretical and math-intensive than practical. Not the best way to prepare for interviews.

Excelente curso, lo deje un tiempo porque no me podía hacer el ejercicio 3 de programación pero fue por no leer bien.

One of the best courses without a doubt!. Although some topics course require more deep / comprehensive discussion

The pace was kind of fast for learners with little base, better to have more reading to facilitate understanding.

This Course was awesome and it can prove benefit to all the students for designing efficient and fast algorithms.

Slightly outdated in terms of slides full of handwriting, but knowledge is laid out perfectly fine. Thanks Tim!

The handwritten text was a bit of difficult to read. The rest of the course is just exactly what is needed.