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
#
lazy-selection
Here are 3 public repositories matching this topic...
python
algorithm
randomized-algorithms
randomized-select
probabilistic-algorithms
lazy-selection
k-smallest
-
Updated
Feb 13, 2023 - Python
💤 Lazy selection algorithm, from Randomized Algorithms (Motwani, Raghavan) p.47
-
Updated
Dec 6, 2018 - Clojure
Improve this page
Add a description, image, and links to the lazy-selection topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the lazy-selection topic, visit your repo's landing page and select "manage topics."