4 ms·
:) FWIW we also use a constant-time sorting network as the base case of the Quicksort recursion, that's a widely used optimization.
by janwas 4y ago
:) FWIW we also use a constant-time sorting network as the base case of the Quicksort recursion, that's a widely used optimization.
- dundarious 4y agoFor 32bits, djb has done light testing, indicating djbsort would be a better base case. > So far I haven't been able to verify these vqsort speed claims. On the contrary, it seems that, for 32-bit data types on AVX2, vqsort would be faster if its base-case code were replaced by a call to the 2018 djbsort code. Similarly, vqsort should reuse vxsort-cpp for AVX-512. https://twitter.com/hashbreaker/status/1533314687726538753 https://twitter.com/hashbreaker/status/1533314687726538753