Chevron Left
Volver a Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Opiniones y comentarios de aprendices correspondientes a Divide and Conquer, Sorting and Searching, and Randomized Algorithms por parte de Universidad de Stanford

4.8
estrellas
5,029 calificaciones

Acerca del Curso

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

Principales reseñas

KS

13 de sep. de 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

26 de may. de 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

Filtrar por:

401 - 425 de 959 revisiones para Divide and Conquer, Sorting and Searching, and Randomized Algorithms

por Mafruha C

12 de nov. de 2017

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

por Gaurav K

13 de dic. de 2016

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

por Rajat N K

14 de nov. de 2019

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

por Mostafa Z

8 de nov. de 2019

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

Thanks a lot.

por Ramazan U

18 de sep. de 2017

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

por George Z

21 de jul. de 2021

The graph theory part is kind of confusing and might need more explanations.

por Anton B

19 de nov. de 2018

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

por Armando J B F

19 de oct. de 2018

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

por shivaranjani g

16 de jun. de 2021

amazing course.learn lot of things. enjoy problem solving using programming

por Jiaxiao W

2 de mar. de 2019

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

por Haochuan W

23 de ene. de 2019

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

por Stjepan H

22 de abr. de 2021

One of the best courses I attended. It is difficult, but totally worth it!

por Jiangbo W

30 de sep. de 2019

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

por Udaya B C

16 de ago. de 2019

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

por Aakash S

14 de abr. de 2018

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

por Dima

13 de mar. de 2017

I like this course a lot. Going to learn everything in the specialization.

por Mohammad N

20 de nov. de 2016

This is a great course for who doesn't have a computer science background!

por BRUCE

23 de abr. de 2018

Finished part I, keep going! This is one of the best courses in Coursera.

por 李培春

5 de mar. de 2017

老师讲课的方式挺独特的(与中国的课堂相比),不过很容易接受。有些视频是没有中文字幕的,在没有字幕的情况下,有点跟不上老师的语速。讲得很清晰,很喜欢

por Gaurav C

12 de oct. de 2019

That's the best you can get from any professors out there, with quality.

por Николай

13 de jul. de 2019

Very good course. Very hard, very interesting and very useful. Thank you

por Gaurav J B

6 de feb. de 2018

This is really helpful and worth course for deep learning of Algorithms.

por Nguyen H D

6 de jun. de 2017

Wonderful course! I enjoy mathematical analysis for algorithm very much.

por Pathik S

5 de sep. de 2022

Very informative and helps to think in algorithmic way for the problem.

por Saurabh V

18 de may. de 2020

It takes me too much time to understand but it is simply a nice course.