Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!cs.utexas.edu!uunet!mcvax!tuvie!brock
From: brock@tuvie (Inst.f.Prakt.Info 1802)
Newsgroups: comp.lang.c
Subject: Re: sort
Message-ID: <715@tuvie>
Date: 30 Jun 89 12:09:50 GMT
References: <166@stsim.UUCP> <4700040@m.cs.uiuc.edu> <950@cbnewsl.ATT.COM>
Reply-To: ulrich@vip.UUCP (Ulrich Neumerkel)
Organization: Technical University of Vienna, EDP-Center
Lines: 16

In article <950@cbnewsl.ATT.COM> mpl@cbnewsl.ATT.COM (michael.p.lindner) writes:
>In article <4700040@m.cs.uiuc.edu>, kenny@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