Heapsort Notes
If d keys fit on a cache line then moving to a d-heap give better spatial locality and reduces cache misses.
In addition, if d is small then a d-heap has fewer instructions than a binary heap.
Heapsort is not usually the sorting algorithm of choice, but it has some advantages: in-place, O(n log n) performance, no stack or recursion.