Вернуться к Divide and Conquer, Sorting and Searching, and Randomized Algorithms

# Отзывы учащихся о курсе Divide and Conquer, Sorting and Searching, and Randomized Algorithms от партнера Стэнфордский университет

4.8
звезд
Оценки: 4,208
Рецензии: 790

## О курсе

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

Фильтр по:

## 176–200 из 772 отзывов о курсе Divide and Conquer, Sorting and Searching, and Randomized Algorithms

автор: 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).

автор: Mayur R P

Jun 03, 2020

Can we do better?

Yes.

Search for best optimised way using Divide and Conquer..

Thanks to Tim (instructor) for creating such a great interactive program.

автор: 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.

автор: Péricles L M

Jun 29, 2020

I had an amazing experience and a good review to main topics on Algorithms theory and I learned some nice new algorithms like Karger Algorthm.

автор: 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.

автор: 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.