| From: | David McMinn |
| Date: | 1 Sep 2001 at 13:34:08 |
| Subject: | Re: Sorting |
On 31 Aug 01, at 23:46, Steve broke out long enough to write:
> I'll check them out. My own routine is sort of based on a bubble algorithm,
> but it sorts from both ends of the array at the same time, and quits when no
> swaps are made.
I take it you only do 2 swaps per loop? I wrote a routine like that, and it
was about 40% faster than my own bubble sort routine (both written in basic
- which might have been the problem). I guess they'd be a damn sight faster
if I used a faster algorithm and converted to ASM, but I can't be bothered.
Not even sure why I wrote it instead of using the built in functions :)
BTW, I thought Sort() was for lists, but I was only quickly flicking
through the manual, so perhaps I was wrong. But if it is for lists, that
would explain why it crashes ;)
[) /\ \/ ][ [) |\/| c |\/| ][ |\| |\| | dave@blitz-2000.co.uk
http://members.nbci.com/david_mcminn | ICQ=16827694
---------------------------------------------------------------------
To unsubscribe, e-mail: blitz-list-unsubscribe@netsoc.ucd.ie
For additional commands, e-mail: blitz-list-help@netsoc.ucd.ie