3 ms·
Heapsort has poor cache performance though. Its asymptotic complexity depends on the assumption that memory access is O(1), which is not borne out in practice.
by sbi 12y ago
Heapsort has poor cache performance though. Its asymptotic complexity depends on the assumption that memory access is O(1), which is not borne out in practice.
- nightcracker 12y agoThis is true, but the worst case of quicksort is so rare that this does not matter for average performance.