Re: Sorting routine
  Home FAQ Contact Sign in
comp.lang.forth only
 
Advanced search
POPULAR GROUPS

more...

 Up
Re: Sorting routine         

Group: comp.lang.forth · Group Profile
Author: dkelvey
Date: Sep 3, 2008 17:45

On Sep 2, 5:10 pm, Dennis Ruffer speakeasy.net> wrote:
> On 2008-09-02 16:17:22 -0500, "dkel...@hotmail.com" hotmail.com> said:
>
>
>
>> On Sep 1, 2:29 pm, Dennis Ruffer speakeasy.net> wrote:
>>> On 2008-08-30 17:05:38 -0500, Jonah Thomas gmail.com> said:
>>>> Elizabeth D Rather forth.com> wrote:
>>>>> The FSL (or other collections, which I wish existed) is the
>>>>> right place for such things. Not the Standard.
>
>>>> A long time ago there was a Forth sort competition. I vaguely remember
>>>> that a Batcher sort won that competition, because of the particular
>>>> demands and how they were weighted.
>
>>> I have a version of the Divide and Konker Sort
>
>>> \ The Divide and Konker sort was submitted as a reply to FIG's Contest
>>> \ of Sorts in Forth Demensions Sept/Oct 1989 by:
>>> \ Dwight K. Elvey
>>> \ 1300 Warren Drive
>>> \ Santa Cruz, CA 95060
>
>> I wrote "Divide and Konker". It is a simple ratix 256 basket sort. It does
>> require additional memory space compared with "in-place" sorts like quicksort
>> but it is so much faster on things like intergers that it is worth dealling
>> with.
>> A faster sort ( I sent a letter to the editor a month or two later ) is
>> a 256 radixed distribution sort. It was even faster and used less memory
>> space.
>
> Glad to hear you are still around Dwight. At this point, I can't
> remember if I ever saw your follow up letter, or if I ever did anything
> with it. However, I also used it on a few projects and was quite
> impressed with the speed.
>
> DaR

Hi
I'm glad to see that someone got some use from it. It was fun to show
people
that the things they believe may not always be true.
I think you'd like the distribution sort. It uses one less temporary
array.
After I sent the original code in to the contest, I thought I'd play
with
the distribution sort. Being slightly faster and using less memory, I
was sure
someone else would have hit on it and send it in. I worried the entire
time until the publication was received.
I've described the distribution sort here before but if anyone wants
I can
go through it again. Maybe someone can code it up and post it.
Dwight
no comments
diggit! del.icio.us! reddit!

RELATED THREADS
SubjectArticles qty Group
Re: Sorting order with sort()macromedia.labs.spry_framework_for_ajax_prerelease ·