What is Median of Medians algorithm for Selection Problem?

The Median of Medians algorithm is a linear time algorithm to solve selection problem or to find median of an unsorted list. In this video, we construct and illustrate form scratch.

------------------
Time Stamps:

00:00 Intro
00:30 - Selection Problem
02:46 - First Idea (Quick Select Algorithm)
04:26 - Prune and Search Technique
05:45 - Approximate Median or Good Pivot
06:45 - Find Median of Medians and Analysis
09:40 - Runtime Analysis
12:16 - Illustration with an example
14:16 - Take Away
15:10 - Problems to Think About
------------------
IdeaBehind Series on Algorithms is a series of 15-20 (we'll count later) animated videos exploring, otherwise mysterious, algorithms in an intuitive perspective. Feedback and suggestions are welcome.
------------------

Bundle of thanks to Reed Mathis for background music.
Animations done in ManimGL with Huge Thanks to Grant Sanderson.

[MilkywayWarrior]

Amazing times we live in.
Dude has only 60 subs, but created a very intuitivie explaination of an algorithm. Instead of this video getting lost in the ocean of information, the video has risen to the top, just because it was the best one out there.
Like quality actually matters and anyone can add something from theirselves.

[abhishekmoramganti]

I know it's been a year since you've posted anything else but you should really try teaching algorithms again bro. You're so good at explaining things

[abhivaryakumar]

Had to watch 3 videos before i found yours
Amazing video man, you make it seem so effortless

[chi]

You actually saved my life!
Thanks for the great explanation

[poojasawant]

This video was really helpful Explaintation of algo and then problems to think about really great! Please keep making such videos

[ye-xin]

thank you for this video, it's really well done!

[harshsegyan]

thanks sir, u explain very deeply, loved it, hats off to u

[harshsegyan]

ap ese hi samjate raho, ache log apki video dekege,

[ShobhitChola]

can you please explain how to handle duplicates?

[marskid]

(at 2.41 shouldn't the cost of sorting be O(blown) as opposed to omega? nlogn is the worst case scenario for merge sort.

[tachles_math]

So it's just to find the median and from there i do quicksort and that ensures nlogn time complexity?

[apstudent]

the way im watching this as a Rutgers student just trying to pass meanwhile u as a Rutgers student made the video 😭😭

[kushagrakasliwal]

on 7:21 you are incorrect, you computed the median directly via sorting, which would take nlogn time

[shashanksharma]

Please improve audio. You speak as if you are sleepy and un-interested