3 ms·
Heap sort gets beat by sorting algorithms with better locality. You can't be the fastest while skipping through memory for every operation.
by CyberDildonics 3y ago
Heap sort gets beat by sorting algorithms with better locality. You can't be the fastest while skipping through memory for every operation.
- janwas 3y agoAgreed. And I am not aware of a heapsort that can take advantage of SIMD, so our not very well-tuned heapsort is about 20 times slower in practice than our VQSort (vectorized quicksort).