Chevron Left
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개 리뷰 중 251~275

교육 기관: Sai R

Nov 19, 2016

This course has some great quiz questions. I'd recommend it to people just for them.

교육 기관: ZUWEI L

Apr 28, 2019

Very interesting course. It also gives me a chance to improve my computer language.

교육 기관: Difu W

Apr 12, 2018

If the words on the screen were typed, the learning experience will be much better!

교육 기관: Pavel P

May 24, 2020

Great course! Very good and clear explanations, really good math. I will continue.

교육 기관: Alexandr K

Apr 07, 2019

Great in-depth explanation of algorithm analysis, good examples of learned topics!

교육 기관: charles

Nov 24, 2016

Very good course on algorithms, a lot of terms explained in details with exercises

교육 기관: Anil K M

Nov 20, 2017

One of the best courses on Divide & Conquer and Randomized Algorithms on the web.

교육 기관: Daniel H

Dec 23, 2016

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

교육 기관: Adeesh

Apr 01, 2020

Great explanation . All the algorithms are thought with proof of time complexity

교육 기관: Aditya K J

Mar 31, 2018

A comprehensive courses with details on correctness,implementation and analysis.

교육 기관: Udhayakumar S

May 31, 2017

Understood very much about random algorithms. Appreciate the rigour in analysis.

교육 기관: Isaac S R

May 12, 2018

Outstanding introduction to algorithms with great practice problems and quizzes

교육 기관: Yifan W

Oct 24, 2016

It's an amazing courses aiming to high-level and fast-pace algorithmic thinker.

교육 기관: Mafruha C

Nov 12, 2017

This cource is a path of my passion to enjoy the intelligent thought and being

교육 기관: Gaurav K

Dec 13, 2016

Sir Tim Roughgarden teaches very straight forward and easy .I like the course.

교육 기관: Rajat N K

Nov 14, 2019

Extremely important course if you are looking to revise your algorithm skills

교육 기관: Mostafa Z

Nov 09, 2019

I have really learned a lot and made me explore different topics

Thanks a lot.

교육 기관: Ramazan U

Sep 18, 2017

Great course! Beginners should be ready to put in some serious effort though.

교육 기관: Anton B

Nov 19, 2018

Handwriting is difficult to understand sometimes but the content is awesome.

교육 기관: Armando J B F

Oct 19, 2018

Excellent, in-depth course. The use of randomness was indeed 'illuminating'.

교육 기관: Jiaxiao W

Mar 02, 2019

very clear and organized course. I learned a lot from it. Thank you so much

교육 기관: Haochuan W

Jan 24, 2019

Best online course I've taken. You can possibly cross out the "online" too.

교육 기관: Jiangbo W

Sep 30, 2019

Appropriate amount of content, but a little hard. After all it's Stanford!

교육 기관: UDAYA B C

Aug 16, 2019

Best professor, these concepts helped me a lot in competitive programming.

교육 기관: Aakash S

Apr 14, 2018

Concepts are very well explained and the quality of quizzes are top-notch.