| From: | Steve Hargreaves |
| Date: | 4 Aug 2001 at 10:24:14 |
| Subject: | Re: sort and sortlist |
On 04-Aug-01, Dan Arico said -
>DA> I thought bubblesort is already fairly quick. iirc There`s a sort
>DA> source on aminet showing some sort routines. Check that out, it had
>DA> at least one very fast routine. It shows graphically how fast too.
>DA It's actually a fairly slow sort. Its efficiency drops off extremely
>DA fast once you get more than a few elements in the list.
And my array has a theoretical maximum of 5000 elements (though I've only used
about 300 of them personally), and if there's any demand, that could go up. (The
program is GHelp, a global help system, and the array holds the filename of all
AmigaGuides on your system - I assume no-one has more than 5000 ATM)
>DA If one item at a time is being added, a tree would probably be a lot
>DA more efficient, but it's going to involve using pointers in some
>DA fashion to accomplish the task.
I'm not familiar with this method. When I was at college training in COBOL, we
did a few different sort routines, but that was nearly 20 years ago, and I
can't remeber a thing - Ahh, those hazy, crazy, lazy, high and drunk days of
college. I'd love to know what I've forgotton :o)
Regards
Steve
========================================================
//Amiga 1200, '060/50, OS3.9, EZ-Tower, Dopus,
// PC Keyboard W EZ-Key, 56K modem, 2+16 Meg,
\\ // NEC 2A Multisync, Logic 3 SpeedMouse, HPDJ610C,
\\/ Sega Controller, & no hair.
=========================================================
We have danced our last little dance, Mr.Morden. Now it is time for you
to go away.
-- Londo
---------------------------------------------------------------------
To unsubscribe, e-mail: blitz-list-unsubscribe@netsoc.ucd.ie
For additional commands, e-mail: blitz-list-help@netsoc.ucd.ie