Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Coursera Courses ↗ · Coursera

Open Course on Coursera

Free to audit · Opens on Coursera

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Coursera · Intermediate ·📐 ML Fundamentals ·4h ago
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).
Watch on Coursera ↗ (saves to browser)
Profile Your Python Code for Speed and Memory
Next Up
Profile Your Python Code for Speed and Memory
Real Python