This program was designed for an assignment in a university level algorithms and data structure course. The code was originally derived from a template of a QuickSelect algorithm, with the task being to convert it so that it would run in linear time. This was to be accomplished by choosing the sorting algorithm's pivot using the median of medians method.
-
Notifications
You must be signed in to change notification settings - Fork 0
An implementation of a linear time selection algorithm using medians of medians pivot selection method
License
ajdeziel/linear-select-algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An implementation of a linear time selection algorithm using medians of medians pivot selection method
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published