Since we're already using O(N) space, it would be interesting to see how this compares to Radix sort[0], which is O(N) space but O(N) time ( due to just hashing everything ).
Like others have said, it would be cool to see quadsort stacked up to other current state-of-the-art sorting algorithms.
Like others have said, it would be cool to see quadsort stacked up to other current state-of-the-art sorting algorithms.
[0] https://en.wikipedia.org/wiki/Radix_sort