Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!uunet!willett!ForthNet
From: ForthNet@willett.UUCP (ForthNet articles from GEnie)
Newsgroups: comp.lang.forth
Subject: All Sorts of Sorts
Message-ID: <438.UUL1.3#5129@willett.UUCP>
Date: 11 Feb 90 03:22:56 GMT
Organization: Latest link in the ForthNet chain.  (Pgh, PA)
Lines: 17


 Date: 02-09-90 (07:29)              Number: 2876 (Echo)
   To: IAN GREEN                     Refer#: 2874
 From: STEVE PALINCSAR                 Read: NO
 Subj: LEARN TO SORT                 Status: PUBLIC MESSAGE

 How does the selection sort compare to the bubble sort in your 
 application?  In my (*very*) limited experience I found the selection 
 sort to be considerably faster (between 2 & 4 times faster) in sorting 
 80 character long strings quantity 100-250.

 Selection sort is also, according to Knuth, a stable method, preserving 
 the original order for identical keys.  It's also extremely easy to code
 and understand -- far more so than the bubble sort.
-----
This message came from GEnie via willett through a semi-automated process.
Report problems to: 'uunet!willett!dwp' or 'willett!dwp@gateway.sei.cmu.edu'