Re: Sorting Algorythms

[D Finnigan <dog_cow@macgui.com>]

gids.rs wrote:
> I am sure everyone has dabbled in and programmed a sorting algorythm at
> some time while playing on their Apple II computer.
> 
> What I would like to know is there any programs out there other than the
> usual talked about ones or one they may have created themselves?
> 
> Bubble sort, Bi-bubble sort, Shell Metzner sort, Quick Sort, Field Sort,
> Binary search sort, Heap sort, Interchange sort.
> 
> 
> And what is the fastest sort anyone has come across.  Is Quicksort the
> fastest?
> I re-engineered a sort that I came across, but I do not know the name of
> it, that is about 35% faster than the quicksort.  With the added advantage
> of leaving the original in tact as well as have multiple tag alongs and it
> sorts numbers properly where the number 2 is less than 10.  Most sorts
> will
> not sort numbers properly.
> 
> Rob
>

There is a CALL-A.P.P.L.E. article that compares all those sorting
algorithms with run-times and BASIC source code. I believe it is in Peeking
at CALL-A.P.P.L.E. 1979.

I read it just a few weeks ago.


-- 
]DF$
Apple II Book: http://macgui.com/newa2guide/
Apple II Archive: http://macgui.com/vault/
Apple II Web & Blog hosting: http://a2hq.com/