Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!uunet!pyrdc!gmu90x!peraino
From: peraino@gmu90x.gmu.edu (peraino)
Newsgroups: comp.sys.handhelds
Subject: RE: sorting on the 28s
Message-ID: <2423@gmu90x.gmu.edu>
Date: 5 Dec 89 13:12:48 GMT
Organization: George Mason Univ., Fairfax Va.
Lines: 23


>Well, insertion sort is only better than bubble sort by a constant factor.
>I'll try to write a sort routine that sorts 50 numbers in 30 seconds or so.
>This should be possible. (I hope)

>Ge' Weijers, ge@cs.kun.nl


     I don't suppose anyone besides myself grabbed the recursive
quicksort that was posted here a while back?






-----------------------------------------------------------------------------
       Bob Peraino                   UUCP    : uunet!pyrdc!gmu90x!peraino
 George Mason University             INTERNET: peraino@gmuvax.gmu.edu
UCIS, Thompson Hall, rm 2 <-         BITNET  : peraino@gmuvax
  4400 University Drive     \        PHONE   : (703)-323-2549
   Fairfax, VA  22030        \- Yeah, they put us in the basement, too.
-----------------------------------------------------------------------------