學生對 斯坦福大学 提供的 Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的評價和反饋

4.8
3,203 個評分
570 個審閱

課程概述

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

熱門審閱

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.

FR

Mar 16, 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

201 - Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的 225 個評論（共 551 個）

Oct 30, 2016

Nice!

Jun 02, 2018

WOW

May 06, 2017

The instructor speaks very clearly and describes everything in a good amount of detail. There were quizzes throughout lectures that keep you engaged and test your understanding, and I liked that I could use the problem sets as a way to practice since there's no penalty for multiple tries. I really enjoyed the course and would highly recommend it to anyone looking for a solid understanding of algorithms.

Oct 22, 2017

This course can be really useful not only for junior engineers or students but also for middle engineers. It was fun and challenging. Thank you for this course.

Nov 26, 2016

Dec 26, 2017

Great structure and the quiz questions are also pretty good

Jan 28, 2018

Roughgarden creates a great mental model for algorithms. He explains the ideas that connect them and how they are organized. He doesn't waste your time, hitting the key components in both the math proofs and in explaining the algorithm implementation. The way he teaches in like induction; he uses a super simple example (base case) and abstracts that out to get the general case.

After the course, I *get* algorithms now... (instead of memorizing them, I can see how to deduce them). Thank you!

Feb 28, 2018

brilliant!

Aug 26, 2017

Very clear explanation. Contents covered are helpful for understanding time complexity analysis.

Jul 25, 2017

Great class! Very clear mathematical explanations and challenging (but rewarding) assignments

Dec 23, 2016

Excellent course! I would recommend it to everyone who wants to learn algorithms.

Jun 03, 2017

Best

Mar 27, 2018

The instructor was excellent. His way of teaching was really good

Jul 23, 2017

The content is absolutely amazing and thought-provoking. Though I am still on the free trial I have to say that from what I have learnt I know the dollars will be worth it.

Mar 05, 2017

Aug 22, 2017

really good, it helps me learn deeper about the algorithms.

Jan 17, 2017

The course was quite useful and enlightening！I was a good start to learn algorithms!

Dec 09, 2017

Great course for Algorithms - Fast and instant delivery of concepts, really liked it ...

Jun 06, 2017

Wonderful course! I enjoy mathematical analysis for algorithm very much.

Mar 04, 2018

Good Course

Sep 15, 2017

NICE COURSE

May 19, 2017

Very good course

Dec 30, 2017

fantastic course

Jun 08, 2017

Awesome

Aug 08, 2017

IT'S GREAT