2.2 - Linear Time Selection (Median of Medians Algorithm)

43:22
2.3 - Binary search (in 1D and 2D arrays - upper and lower bounds) and Bitonic search

25:05
2.5 - Closest Pair of Points using Divide and Conquer algorithm in O(n log n) time.

25:49
Median of Medians - Order Statistics

17:28
What is Median of Medians algorithm for Selection Problem?

31:53
8. NP-Hard and NP-Complete Problems

35:42
Quick-Select Algorithm and Median-of-Medians Lecture

29:58
2.10 - Quick Select | Randomized Algorithms

36:44