Quickselect

2 articles

dsa2 min read

Find the Kth largest element using quickselect O(n) average or a min-heap of size K in O(n log k).

March 19, 2026Read →

dsa3 min read

Master randomized DSA algorithms: reservoir sampling for streams, quickselect for O(n) kth element, and random shuffling.

April 27, 2025Read →