Classbaze

Disclosure: when you buy through links on our site, we may earn an affiliate commission.

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer ...
4.8
4.8/5
(4,566 reviews)
174,682 students
Created by

9.1

Classbaze Grade®

N/A

Freshness

8.8

Popularity

8.9

Material

Divide and Conquer
Platform: Coursera
Video: 10h 40m
Language: English

Best Algorithms classes:

Classbaze Rating

Classbaze Grade®

9.1 / 10

CourseMarks Score® helps students to find the best classes. We aggregate 18 factors, including freshness, student feedback and content diversity.

Freshness

Course content can become outdated quite quickly. After analysing 71,530 courses, we found that the highest rated courses are updated every year. If a course has not been updated for more than 2 years, you should carefully evaluate the course before enrolling.

Popularity

8.8 / 10
We analyzed factors such as the rating (4.8/5) and the ratio between the number of reviews and the number of students, which is a great signal of student commitment.

New courses are hard to evaluate because there are no or just a few student ratings, but Student Feedback Score helps you find great courses even with fewer reviews.

Material

8.9 / 10
Video Score: 9.2 / 10
The course includes 10h 40m video content. Courses with more videos usually have a higher average rating. We have found that the sweet spot is 16 hours of video, which is long enough to teach a topic comprehensively, but not overwhelming. Courses over 16 hours of video gets the maximum score.
The average video length is 6 hours 42 minutes of 133 Algorithms courses on Coursera.
Detail Score: 7.7 / 10

The top online course contains a detailed description of the course, what you will learn and also a detailed description about the instructor.

Extra Content Score: 9.8 / 10

Tests, exercises, articles and other resources help students to better understand and deepen their understanding of the topic.

This course contains:

9 articles.
0 resource.
0 exercise.
9 tests or quizzes.

In this page

About the course

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

What can you learn from this course?

What you need to start the course?

Basic knowledge of Algorithms is required to start this course, as this is an intermediate level course.

Who is this course is made for?

This course was made for intermediate-level students.

Are there coupons or discounts for Divide and Conquer, Sorting and Searching, and Randomized Algorithms ? What is the current price?

Access to most course materials is FREE in audit mode on Coursera. If you wish to earn a certificate and access graded assignments, you must purchase the certificate experience during or after your audit.

If the course does not offer the audit option, you can still take a free 7-day trial.
The average price is $6.8 of 133 Algorithms courses. So this course is 100% cheaper than the average Algorithms course on Coursera.

Will I be refunded if I'm not satisfied with the Divide and Conquer, Sorting and Searching, and Randomized Algorithms course?

Coursera offers a 7-day free trial for subscribers.

Are there any financial aid for this course?

YES, you can get a scholarship or Financial Aid for Coursera courses. The first step is to fill out an application about your educational background, career goals, and financial circumstances. Learn more about financial aid on Coursera.

Who will teach this course? Can I trust Tim Roughgarden?

Tim Roughgarden has created 6 courses that got 470 reviews which are generally positive. Tim Roughgarden has taught 284,753 students and received a 4.69 average review out of 470 reviews. Depending on the information available, we think that Tim Roughgarden is an instructor that you can trust.
Computer Science
Stanford University
Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University. He received a BS in Applied Mathematics from Stanford in 1997, and a PhD in Computer Science from Cornell in 2002. His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms. For his research, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Shapley Lecturership of the Game Theory Society, the Social Choice and Welfare Prize, INFORM’s Optimization Prize for Young Researchers, the Mathematical Programming Society’s Tucker Prize, the EATCS-SIGACT Gödel Prize, and a Guggenheim Fellowship.

9.1

Classbaze Grade®

N/A

Freshness

8.8

Popularity

8.9

Material

Platform: Coursera
Video: 10h 40m
Language: English

Classbaze recommendations for you