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

4.8

별점

3,824개의 평가

•

698개의 리뷰

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

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.

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

필터링 기준:

교육 기관: YEH T P

•Jan 07, 2018

Processor Tim is interesting, and the explanation of why the algorithm work is easy to understand. This course is suitable for who know how to program and want to solve problem more efficiently, more elegantly.

교육 기관: Pavlos C

•Jan 03, 2019

Nice approach by Tim. First explains the problem, then the need to the math pops up and then the math naturally arise. Thus no need to memorize any formula, but should be able to derive anything just by logic.

교육 기관: Srikar V

•Aug 11, 2019

This is one of the best courses that I've done. This was my first time studying algorithms and the professor's explanations of concepts are amazing. The quizzes and programming assignments were very helpful.

교육 기관: Euge R

•Apr 08, 2018

Although some part of this course requires a refresh of discrete probability (that i was missing).. This course is really well done and challenging. Tim Roughgarden explains things in a crystal clear way.

교육 기관: THARANGINI S

•Jul 10, 2017

Great Course. The delivery of lectures and emphasis on the core concepts were extraordinary. The assignments were challenging and reinforced the concepts taught. All in all a wonderful delivered course.

교육 기관: 谷心洋

•Jan 11, 2020

It is a good course, but lack some explanation of materials, the teacher didn't explain clearly enough, so sometime you feel hard to understand the full picture, but still, It's a really nice course!

교육 기관: Dung N T

•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

교육 기관: Salvador N

•Mar 26, 2020

I'm happy with this course because is a little challenging, not like other coursers where there are trivial answers and tests. I feel now much more confident with my fundamentals. Thank you Tim!

교육 기관: 缄诺

•Mar 25, 2017

This course has relatively few instructions about homework. I believe more test cases would be better.(Though able to be found in forum.) Besides, lecture is really awesome. Thanks a lot.

교육 기관: Joseph B

•Jun 16, 2018

Challenging and eye opening to algorithm design paradigms. As a code writer for data analysis in a scientific field, this course really motivated me to delve deeper in this rich field.

교육 기관: Tom D

•May 15, 2020

This course was outstanding! Big thanks to Tim for explaining difficult concepts in a clear and concise fashion. I can't wait to get started on the next course in this specialization!

교육 기관: Muskan K

•Sep 15, 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 :-)

교육 기관: GuangXue Z

•May 24, 2019

Very useful and have enough content for self-studying. I'm really enjoy to solve the assignment for every week. And every videos are food for thought. Thanks for this amazing course.

교육 기관: Sai L K

•Jan 17, 2020

I would rate it very high because of the kind of assignments given and kind of questions asked is very very good. I would refer my friends for this kind of professional things.

교육 기관: Randy R

•Jan 29, 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.

교육 기관: Jeje B

•Oct 14, 2017

Great teacher and super interesting content! I definitively recommend this course for those wishing to refresh their memory on algo complexity and various sort of algorithms.

교육 기관: Ciro A M P

•Mar 12, 2019

Great course. It was challenging at times, specially the quizzes and some programming tasks. The final exam was not as hard because there was enough practice in the quizzes.

교육 기관: Rusu E

•Feb 27, 2020

I'm very happy to have taken this course!

It gave me an insight into the mechanics behind algorithms such as QuickSort and made me understand how they work under the hood :)

교육 기관: Bridget L

•Jul 23, 2017

The content is absolutely amazing and thought-provoking. Though I am still on the free trial I have to say that from what I have learnt I know the dollars will be worth it.

교육 기관: Lexie

•Sep 16, 2019

The teacher is dedicated to illustrate every part of the algorithm and the analysis of it. I really enjoy it. I think now I have grasp the algorithm more comprehensively.!

교육 기관: Jephte E

•Dec 28, 2019

I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.

교육 기관: Tian Q

•Jan 06, 2019

Very well explained course content and good quiz and programming assignments. The course focuses on thinking through the algorithm instead of a specific implementation.

교육 기관: Jakob S

•Jan 02, 2019

Great Course, highly recommended. Tim is doing really good explanations of everything, even if this math and programming was a bit much for me i got through the course.

교육 기관: Nicole

•May 03, 2017

Great mental workout. Well-explained, but the coding challenges and bonus questions are challenging enough to allow for a lot of growth even for more advanced students.

교육 기관: Mohamed A H

•Apr 20, 2017

It was an awesome and challenging course.And ,the lecturer Mr.Tim Roughgarden did introduced the gist that I need.So ,of course, I owe him a big thank.Thank you all.