A sorting algorithm that is faster than the general quicksort. O(n + k) runtime where n is the size of the array and k is the range of the numbers. Any help with optimizations would be appreciated
-
Notifications
You must be signed in to change notification settings - Fork 0
samuelm2/Samusort-fast-sort
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A sorting algorithm that is faster than the general quicksort. O(n + k) runtime where n is the size of the array and k is the range of the numbers
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published