Quickselect: Kth Smallest
Medium
Sorting Algorithm Analysis
Print the k-th smallest element in expected O(n) time.
Constraints
1 <= k <= n <= 10^5
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.