Chevron Left
返回到 Divide and Conquer, Sorting and Searching, and Randomized Algorithms

学生对 Stanford University 提供的 Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的评价和反馈

4.8
5,329 个评分

课程概述

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

热门审阅

MK

Sep 14, 2019

This course is awesome and a bit challenging. The special part is about the problem quizzes which is about the running time analyses of the algorithms. And the professor is superb :-)

RR

Jan 28, 2018

This was going to be a review of material for me, just a refresher. But instead I was exposed to a lot of new concepts and really feel like I got some good experience from it.

筛选依据:

926 - Divide and Conquer, Sorting and Searching, and Randomized Algorithms 的 950 个评论(共 1,019 个)

创建者 S A

Dec 22, 2017

Please do not teach graphs before teaching data structures it becomes very tough for students.

创建者 Sahil A

Dec 8, 2021

Amazing course live deep knowledge about divide conquer algorithms like merge and Quick sort

创建者 Irene J

Apr 11, 2020

It is a little bit hard for people who only have Python background, but still pretty good.

创建者 Lawrence S

Jun 27, 2019

The talking speed of instructor is too fast. Is there a way to slow down via the control?

创建者 Andres M H C

Jan 9, 2021

Very nice course. The professor speak really fast but the subtitles are really helpful

创建者 CHANDAN K S

May 4, 2020

instructor speed of telling the concept is very fast so kindly please take care of it.

创建者 Shubham R

Aug 24, 2019

It was a great course and I loved joining this. Clearing my many theoretical concepts.

创建者 Rui Z

Jan 12, 2019

Very good course! Clear explanations and proofs to help you understand the algorithms.

创建者 Priyanshu J

Apr 4, 2020

I would appreciate if implementation of algorithms is also included with this course.

创建者 Rohan K

Sep 12, 2020

The instructor was really really fast. Grasping the concepts was a little difficult.

创建者 Joey

Jul 1, 2020

Awesome course, I found it very helpful in preparation for my developer interviews.

创建者 Nikhil S

Dec 21, 2019

In the very end, it was fun coding the min-cut algorithm and overall I enjoyed this

创建者 Tianyi Z

Jul 16, 2018

Quicksort could be better. The comparison counting is not a good assignment I feel.

创建者 Lucas P

Jan 1, 2019

The classes are very good but I hope they can improve the programming assignments.

创建者 Osmar P

Feb 10, 2021

Extreme well-structured course, but it's really hard to understand the whiteboard

创建者 Dieter V

Nov 16, 2020

Very well explained. Good selection of programming assignments and problem sets.

创建者 Sukhesh B

Nov 14, 2016

Great course to improve your skills on Algorithms, Space and Time complexities

创建者 Sriram R

Nov 12, 2016

Needs hands-on experience with high-school probability to help crack the exams

创建者 Aman S

Apr 3, 2020

The instructor wasn't very good at teaching, but the course is designed well.

创建者 Ashish U

Jul 25, 2019

really helpful course on building concepts on data structures and algorithms

创建者 Aditya K

Jun 29, 2018

Tough one, but if you take time to understand ... it is deep and fun as well

创建者 Yusuf K

Jan 20, 2018

Excellent set of tutorials. Good questions that require critical thinking.

创建者 Keith M

Nov 17, 2020

Good course but make sure your up to speed on probability theory first.

创建者 Pavankumar P

Mar 3, 2022

One of the besst course available on the internet this Stanford course

创建者 Adham I

Jun 3, 2020

I thin it can be more easier as its first course in the specialization