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

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

4.8
별점
3,807개의 평가
695개의 리뷰

## 강좌 소개

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의 676개 리뷰 중 176~200

교육 기관: Ian E

Apr 10, 2017

Professor Roughgarden explains everything clearly and is engaged in the topic. His excitement about algorithms comes though in his teaching.

교육 기관: Piyush M

Aug 28, 2018

Tim is too good in explaining concepts, course is very detailed with very good quality assignments which gives good understanding of theory.

교육 기관: Caique D S C

Apr 17, 2019

Very good, just could have more programming exercises.

And It seems to me that the audio of the lectures is a little bit ahead of the video.

교육 기관: Nicolas T

Oct 20, 2018

Great explanations, a formal course with an informal style. The fact that you can do the assignments in any programming language is a plus.

교육 기관: Johnathan F

Jan 14, 2018

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

교육 기관: Hanyu C

Oct 02, 2017

The lectures are first-class. Detailed on what I need and brief on unimportant stuff. The entire course is logically coherent and precise.

교육 기관: Genyu Z

Jan 12, 2019

This course helps me a lot. The teacher is very good. I'll learn his next course right away. I believe I can improve my knowledge here.

교육 기관: Yiming Z

Jul 17, 2018

A very good course! Just feel excited and motivated to learn algorithms! Now I am determined to be a computer science major in college.

교육 기관: Jose E N H

Nov 06, 2016

it was awsome!! one of the best courses and materials regarding algorithms i have taken!

thanks a lot!

totally worth my time and money =)

교육 기관: Derek A S

Feb 12, 2020

Fantastic course! I thoroughly enjoyed the programming assignments as well as the rigorous mathematical analysis provided in lectures.

교육 기관: Antonio S

Dec 01, 2019

Very well done and clear even for people without a computer science background. Strongly suggested to anyone interested in algorithms

교육 기관: Saurabh M

Aug 15, 2017

Well explanatory lectures with challenging programming assignments with a benefit to code in any language. Over all a great course !

교육 기관: Yayin C

Nov 03, 2019

Very good! Just hope that the speaker could speak a little bit slower and make the slides clearer...Hard to read the hand writing...

교육 기관: Yuanzhan W

Apr 28, 2019

The course is well organized. Clean introduction to most common sorting algorithms and the math behind them. Strong recommendation.

교육 기관: 陈禧琛

Oct 16, 2017

I benefited a lot from this course, and I learned a lot. I will apply for grants, and continue the study of the following courses

교육 기관: Yifu S

Feb 01, 2020

Very Nice course,I have got a Master Degree in Computer Science,but i stll learn much new knowledge and thinks from this course.

교육 기관: Beau D

Nov 17, 2016

The math in this course is quite difficult, but the professor does a great job of explaining it in a very easily understood way.

교육 기관: Luiz C

Feb 24, 2018

Great course, very well explained, great material and great exercises, with an engaging teacher: cant be much better than that

교육 기관: Ali S

Oct 31, 2017

The course is not as not programming oriented as the Princeton one, but it is a better course in terms of theory and analysis.

교육 기관: Amarth C

Aug 24, 2017

Professor's awesome, but some part he speaks a little bit fast, for non-native speaker it asks extra work to fully understand.

교육 기관: Solomon B

Mar 11, 2017

Excellent course. The statistical analysis was a little too fast and overwhelming towards the end but overall I learned a lot.

교육 기관: Ehsan F

Dec 04, 2018

This course was a real one. The only feeling I had afterwards was that I wish I could meet him in person. He is just awesome.

교육 기관: Venu V

Jan 18, 2017

It's an amazing introduction to algorithms. I enjoyed listening to the lectures. All the algorithms were explained in detail.

교육 기관: Jay

Mar 19, 2020

Very Nice course for a newbie like me to mastering algorithms. I want to thank you institute for making this course for us.

교육 기관: Aishwarya R

Jun 21, 2019

Learnt about Merge Sort, Quick Sort, Randomization Algorithms, Selection, Graphs, Min-cut. Thank you Prof. Roughgarden :)