Spreadsort
Hybrid distribution and comparison sort that adapts between radix-like partitioning and comparison sorting.
6 notes
Hybrid distribution and comparison sort that adapts between radix-like partitioning and comparison sorting.
Distribution sorting algorithm that approximates uniform distribution and then refines with insertion sort.
Sort integer keys by placing each value into a direct address slot over a small contiguous range.
Sort elements by building a frequency histogram and reconstructing the output from cumulative counts.
Bucket sort variant that assumes uniform distribution and uses equal-width buckets with simple mapping.
Distribute elements into buckets based on value ranges and sort each bucket independently.