EPISODE · Jan 21, 2020 · 10 MIN
Episode 4 - Quickselect
from Programming · host Minko Gechev
Today we're going to talk about quickselect. This algorithm helps us quickly find the n-th smallest element in unsorted arrays. It'll not only help you improve the performance of your applications, but it's also a very common white-board interview problem.
What this episode covers
Today we're going to talk about quickselect. This algorithm helps us quickly find the n-th smallest element in unsorted arrays. It'll not only help you improve the performance of your applications, but it's also a very common white-board interview problem.
NOW PLAYING
Episode 4 - Quickselect
No transcript for this episode yet
Similar Episodes
May 12, 2026 ·82m
Apr 6, 2026 ·77m
Mar 17, 2026 ·107m
Feb 17, 2026 ·96m
Feb 10, 2026 ·95m