Spreadsort
Spreadsort Spreadsort is a hybrid sorting algorithm that combines ideas from radix sort and comparison-based sorting. It partitions data based on key ranges and recursively sorts partitions, switching to comparison sorting when partitions become small or distribution becomes irregular. It is designed to achieve near linear performance on structured data while retaining robustness on arbitrary inputs. Problem Given an array $A$ of sortable keys, possibly integers, floating point values, or...