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

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

4.8
별점
3,831개의 평가
700개의 리뷰

## 강좌 소개

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.

##### 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

필터링 기준:

## Divide and Conquer, Sorting and Searching, and Randomized Algorithms의 681개 리뷰 중 151~175

Apr 19, 2018

Great Algorithm analysis overview. Concepts are simply explained. Although If you are absolute beginner I recommend you to read the basics term used in statistics.

교육 기관: Lin M K

Oct 12, 2017

Probably, the best course to start learning algorithms. It's not too easy, not too difficult. It's just challenging enough for those who want to learn algorithms.

교육 기관: Yann F

Dec 30, 2019

Very well designed, structured and delivered. I enjoyed the videos and learned a lot from the lectures, quizzes, forum and programming assignments. Great course.

교육 기관: João R W S

May 26, 2017

Very good. Not an easy course but I think that's the idea haha. Tim is a great teacher and the content is very well organized to be didactic. I've learned a lot!

교육 기관: Kandarp K V

May 14, 2020

It is really a very good course if you want to gain deep insight about algorithms. Definitely was slightly above my rank but that's how we learn and think more.

교육 기관: Александр М

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.

교육 기관: Ashish K

Mar 15, 2018

A very good course for having the notion of algorithms, identify problems which can be solved by divide and conquer approach and analyse their time complexity.

교육 기관: Yasar A A

Mar 29, 2020

At first, I found difficulty in catching the content..... it would bounce upon my head rather understanding... overall it was worth of hard work. Good Content

교육 기관: LIU C

Mar 27, 2020

The instructor is simply super cool in teaching. He managed to explain things with all the necessary details in the most concise language. highly recommended.

교육 기관: Sukhdev S

Jul 31, 2017

The course was intense at times, specially the Randomized Contraction Algorithm. Conceptually, it was fine, but the implementations took some serious effort.

교육 기관: Rishiganesh V

Nov 29, 2019

It is Really an amazing Course, mind blowing, very informative, It gives me the complete understanding merge sort and quick with best mathematical analysis.

교육 기관: Matt L

Jul 20, 2018

Well-taught, I love Tim Roughgarden's lecture style. Though he doesn't pull punches when it comes to the math, it's very straightforward and easy to follow.

교육 기관: John C

Jan 12, 2020

I loved it. It's challenging. Definitely requires some thought outside of what he videos cover for some of the quiz questions, but still totally doable.

교육 기관: Parshwanath D

Jul 30, 2018

I'm not a Computer Science student and yet I found these lectures easy to follow. The programming exercises were a good mental exercise. Wonderful course!

교육 기관: Abhishek V

Jan 03, 2017

Very good review of divide and conquer algorithms, however, I only recommend for those who are willing to put in the hard work as I found it challenging.

교육 기관: Peshotan I

Aug 08, 2018

Very good course. Teaches the basics of algorithms very well. Lectures are great but I mostly studied from textbook (you can find it on amazon for \$10).

교육 기관: andrew

Jun 18, 2019

Very well done and presented material! In depth and gives you a deeper understanding of the material (if you pay close attention in lectures that is)!

교육 기관: Minsub L

Apr 06, 2019

Very good lecture to improve algorithm skills and basics for those who had not ever take class of algorithms. Thank you for your teaching, professor.

교육 기관: Rebecca D

Mar 30, 2017

I thoroughly enjoyed this course. I learned a great deal, and particularly enjoyed the programming assignments. Looking forward to starting course 2.

교육 기관: John W

Jul 08, 2017

Really enjoyed watching the lectures and Prof Roughgarden's explanations. He did a good job diving just deep enough into the math without losing me.

교육 기관: Liam Y

Jul 30, 2017

The course is challenging but rewarding. If you take diligent notes and make sure you rewatch videos as needed it yields a great deal of knowledge.

교육 기관: Max L I

Aug 12, 2017

Tim Roughgarden does an amazing job at explaining this topic. The only very very small downside is, that video and voice are not always in sync.

교육 기관: Yaz

Jan 05, 2018

An excellent course. Frees your mind from the high school paradigm of procedural approach to Maths at the expense of pure, ground up reasoning.

교육 기관: Himanshu G

Sep 14, 2017

Excellent course. Professor Roughgarden did a splendid job of explaining the most intricate details in a way understood by even weak students.

교육 기관: NoneLand

Mar 17, 2018

This course is about following topics: large integers multiplication, merge sort, quick sort, master method and Karger's min-cut algorithms.