Bucket Sort
← Back to Non-Comparison
Distributes elements into a number of buckets, sorts each bucket individually (often with Insertion Sort), then concatenates. O(n + k) average time for uniformly distributed data. Useful for floating-point values in a known range.