Sorting is a hobby-horse of mine, so I cannot resist the temptation to
elaborate on the subject. I was motivated to write this rather long
reply by Carsten Kehler Holst saying `As far as I can see the
difference between merge sort and heap sort as described by Jon is
almost non existing'. Carsten
--167E2781446B
Content-Type: text/plain; charset="us-ascii"
Ralf Hinze wrote:
> Practitioners are probably surprised to learn that `pairingSort' is the
> algorithm of choice for sorting. Any objections to this recommendation?
> I was surprised to see that it performs so well: sorting