Back to Courses

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Overview

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

View Course
English
Coursera
Your dream job is just a tap away — only on the BoostGrad app.
View on Boostgrad App
View on Browser
Continue