Select k-smallest item in an array A in nearly 2n time using LAZY-SELECT. Also implemented naive sorting & linear select algorithm.
-
Updated
May 7, 2019 - Python
Select k-smallest item in an array A in nearly 2n time using LAZY-SELECT. Also implemented naive sorting & linear select algorithm.
💤 Lazy selection algorithm, from Randomized Algorithms (Motwani, Raghavan) p.47
To associate your repository with the lazy-selection topic, visit your repo's landing page and select "manage topics."