Empirical testing of the following theorem:
Theorem 3.5:
With probability 1 - O(n^{-1/4}), LazySelect finds S_k on the first
pass through, and thus performs only 2n + o(n) comparisons
$ lein run
-
Notifications
You must be signed in to change notification settings - Fork 1
💤 Lazy selection algorithm, from Randomized Algorithms (Motwani, Raghavan) p.47
License
carlosgeos/lazy-selection
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
💤 Lazy selection algorithm, from Randomized Algorithms (Motwani, Raghavan) p.47
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published