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).
Analysis of Contraction Algorithm
Loading...
Skills You'll Learn
Algorithms, Randomized Algorithm, Sorting Algorithm, Divide And Conquer Algorithms
Reviews
4.8 (4,685 ratings)
Mar 15, 2017
Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec
Jun 10, 2017
A really exciting and challenging course. Loved the way the instructor explained everything with so much detail and precision. Definitely looking forward to the next course in the specialization.
From the lesson
Week 4
Linear-time selection; graphs, cuts, and the contraction algorithm.
Taught By
Tim Roughgarden
Professor
Explore our Catalog
Join for free and get personalized recommendations, updates and offers.
Coursera Footer
© 2021 Coursera Inc. All rights reserved.
