Bogosort (was: old threaded languages, was Re: Symbolics)

From: Dwight Elvey <elvey_at_hal.com>
Date: Wed Mar 1 20:28:38 2000

"Fred Cisin (XenoSoft)" <cisin_at_xenosoft.com> wrote:
> Lately I keep running into people who are using "SORT" programs when that
> isn't even what is called for.
>
> 1) Large sorted data file. Additional records are appended to the file.
> Then the file is "SORTED" again. All of the "good" sorts being mentioned
> take the same amount of time to sort the file regardless of whether the
> content is random, or almost in order. For this particular example,
> therefore, they take significantly LONGER than a properly written Bubble
> sort (needs to be written to make each pass going down)
> for (j=n-1; j>0; j--) . . .

Hi
 Usually I first sort the new data and do a merge, which
is essentially a single pass bubble sort.
Dwight
Received on Wed Mar 01 2000 - 20:28:38 GMT