Spread Sort is a comparison-based sorting algorithm optimized for uniformly distributed numbers. It divides the range of input values into bins, recursively sorts bins, and merges them efficiently.
Paradigm
Bucket / Distribution
Author
Steven J. Ross
Tier
Time Complexity
Best
Avg
Worst
Space
O(n)
Properties