Menu
According to wikipedia, heapsort runs more quickly on computers with small or slow data caches. How could having a slow data cache improve performance ?
617
It is compared to merge sort.
In the same paragraph merge sort is mentioned as a competitor, in that context it means that heap sort gets faster compared to merge sort with small cache sizes.
122
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
