Date:	Wed, 25 Feb 1998 11:49:59 +0100 (MET)
From:	Jan Hubicka <hubicka AT ta DOT jcu DOT cz>
To:	Paul Szuch <spamlessdunkelzan AT geocities DOT com>
cc:	djgpp AT delorie DOT com
Subject:	Re: Sorting Algorythums
In-Reply-To:	<6cv625$7o6@ds2.acs.ucalgary.ca>
Message-ID:	<Pine.LNX.3.95.980225114930.16200A-100000@tabor.ta.jcu.cz>
MIME-Version:	1.0

On Tue, 24 Feb 1998, Paul Szuch wrote:

> Don't forget Radix or Bucket sorts both are the fastest I know of at
> O(N) but have some special requirements. Radix will only compare
> integers and bucket requires temporary storage.
is description of Bucket sort available anywhere? I was looking for it
at the net, but no success..

Honza
> 
> On Sun, 22 Feb 1998 22:14:18 -0800, "STEVEN S. FALLS"
> <broadview AT earthlink DOT net> wrote:
> 
> >    What is the best sorting algorythm and what is it. I mean, how would
> >one program the algrothym?
> >            Thanks,
> >                        -Ardy
> >
> 

------------------------------------------------------------------------------
                   Have you browsed my www pages? Look at:
                       http://www.paru.cas.cz/~hubicka
      Koules-the game for Svgalib,X11 and OS/2,  Xonix-the game for X11
      czech documentation for linux index, original 2D computer art and
              funny 100 years old photos and articles are there!

- Raw text -