An implementation of the BucketSort Algorithm with using InsertionSort in each of the buckets. This implementation makes 10 buckets of equal ranges, and then puts each element into the correct bucket. After placing the element into the bucket then, InsertionSort is run onto each of the buckets. After which, the data is combined together into an array and is returned.
-
Notifications
You must be signed in to change notification settings - Fork 1
abelen/BucketSort
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An implementation of the BucketSort Algorithm with using InsertionSort in each of the buckets.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published