Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles; site smu.UUCP
Path: utzoo!watmath!clyde!burl!mgnetp!ihnp4!inuxc!pur-ee!uiucdcs!smu!pedz
From: pedz@smu.UUCP
Newsgroups: net.lang
Subject: Re: Re: A Simple Bubble Sort Function - (nf)
Message-ID: <19700003@smu.UUCP>
Date: Wed, 13-Jun-84 13:35:00 EDT
Article-I.D.: smu.19700003
Posted: Wed Jun 13 13:35:00 1984
Date-Received: Sat, 16-Jun-84 03:00:04 EDT
References: <7471@umcp-cs.UUCP>
Lines: 15
Nf-ID: #R:umcp-cs:-747100:smu:19700003:000:575
Nf-From: smu!pedz    Jun 13 12:35:00 1984

#R:umcp-cs:-747100:smu:19700003:000:575
smu!pedz    Jun 13 12:35:00 1984

The radix sort will almost always win out if applied properly and the
list to sort is reasonable large.  All of the sort algorithms
mentioned above are O(n^2) (worst case).  There are several sorts
(mergesort, heap sort, ...) which are guaranteed to be O(n log n)
which will usually over a O(n^2) but not alway becuase of the contant
terms.  With large cases they will thought.  However, some sorts (such
as the bubble sort) are the best sorts in particular applications.
But I still maintain that a radix sort will come out ahead in almost
all cases.

Perry
convex!smu!pedz