Initial code for rSort is now available via CVS. It contains a module, Sort, that can perform 7 different sorts on arrays of comparable objects. These are bubble sort[O(n2)], bidirectional bubble sort (cocktail or shaker sort[O(n2)]), comb sort[O(n log n)], selection sort[O(n2)], insertion sort[O(n2}], and shell sort[O(n1.25)]. combsort11 can be done by passing a parameter to comb sort, and all sorts except shell sort have options for timing, reporting of compares and swaps, and rudimentary visualisations.

No documentation yet, and not heavily-tested, so use at your own risk!