Listen "Episode 4 - Quickselect"
Episode Synopsis
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.
More episodes of the podcast Programming
Episode 24 - AI Agents
13/12/2025
Episode 22 - Signals
10/01/2025
Episode 20 - Static and Dynamic Systems
23/06/2020
Episode 19 - Type Systems and Type Checking
16/06/2020
Episode 18 - How JavaScript Bundlers Work
25/05/2020
Episode 17 - Dependency Injection
21/04/2020
Episode 16 - Memoization
14/04/2020
ZARZA We are Zarza, the prestigious firm behind major projects in information technology.