Sorting and adaptive sorting

Ralf Hinze
Fri, 28 Jun 2002 10:11:45 +0200

There seems to be a renewed interest in sorting and in adaptive
sorting. A while ago (pre Haskell 98) I compiled a rather extensive
library of sorting routines you may want to look at


This includes different versions of mergesort, introspective sort
(quicksort with a log n depth bound), heapsort etc.

Cheers, Ralf