sort

[Inst.f.Prakt.Info 1802]

In article <950 at cbnewsl.ATT.COM> mpl at cbnewsl.ATT.COM (michael.p.lindner) writes:
>In article <4700040 at m.cs.uiuc.edu>, kenny at m.cs.uiuc.edu writes:
>> Glenn Ford (uunet!ocsmd!stsim!glenn) writes:
>> >Does anyone have a sort routine (in memory sort) faster than quicksort, of
>Of COURSE a sort can be faster than quicksort.  First of all, quicksort has
[...]
>I'm sure someone out there has a radix sort or some such that they'd share
>with us.

May I refer to
G.H.Gonnet
Handbook of Algorithms and Data Structures
Addison-Wesley Publ.Comp. 1984
You find there Heap-, Shell-, Radix-, Merge-...sort both in C and Pascal source.

Ulrich