[A83] Re: fschk83


[Prev][Next][Index][Thread]

[A83] Re: fschk83




Unless it uses quicksort, in which case the sorting would work the
slowest possible for that algorithm...

-----Original Message-----
From: assembly-83-bounce@lists.ticalc.org
[mailto:assembly-83-bounce@lists.ticalc.org] On Behalf Of Michael
Vincent
Sent: Wednesday, February 20, 2002 5:12 PM
To: assembly-83@lists.ticalc.org
Subject: [A83] Re: fschk83


Actually the calculator would be probably noticeably faster with
sorting.
The PRGM menu would display faster, and MirageOS sort would be much
quicker...

Michael Vincent
Detached Solutions - www.detacheds.com
Radical Software - www.radicalsoft.org www.michaelv.org
----- Original Message -----
From: "Gavin Olson" <gtolson@snet.net>
To: <assembly-83@lists.ticalc.org>
Sent: Wednesday, February 20, 2002 2:58 AM
Subject: [A83] Re: fschk83


>
> At 08:03 PM 2/20/02 +0100, you wrote:
>
> > > another idea: a defragmenter. Wouldn't the calc be faster
> >if you have lots
> > > of programs and they are all sorted alphabetically?
> >
> >Probably you are going too far in the analogy. :)
> >
> >PG
>
>
> No, because all locations of memory can be accessed at the same
> speed.  This is how that nifty SCSI drive in the latest Maximum PC hit
a
> seek time of .02ms in all situations.  Contiguity is not an issue (and
all
> calc files are contiguous)
>
>
>






References: