-
Notifications
You must be signed in to change notification settings - Fork 0
This is an algorithm that solves the problem of selection, i.e. finding the k-th largest of n numbers. This implementation works on words consisting of small letters of the Latin alphabet, pessimistic complexity O (n)
VVeaz/medianOfMedians
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 | |
|---|---|---|---|---|
About
This is an algorithm that solves the problem of selection, i.e. finding the k-th largest of n numbers. This implementation works on words consisting of small letters of the Latin alphabet, pessimistic complexity O (n)
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published