Re: Speed & Choose from list
Re: Speed & Choose from list
- Subject: Re: Speed & Choose from list
- From: email@hidden (Michael Sullivan)
- Date: Tue, 7 May 2002 22:16:21 -0400
- Organization: Society for the Incurably Pompous
email@hidden (Stephen Swift) writes:
>
But as most agreed, all options were fast and easy to use. I just found it
>
interesting trying to figure out which was the most efficient if it had to
>
run through a huge huge list (looking at the amount of code & speed).
>
If you can't remember the scripts I'm referring to, below are excerpts
>
containing the basic idea of the script:
One thing I should note here. The lists you tested are not huge at all,
though they are about as large as one would ever pipe to a "choose from
list" command.
On lists that store a lot of information, and might contain, say 1000 or
10,000 items, the efficiency of using tids to get the O(n) constant down
at machine level, or of the log(n) binary search algorithm would make
itself known.
On lists below 100 items, a simple "bad" algorithm will often beat more
complicated "better" algorithms, because the setup time for the more
complicated algorithms adds a large constant.
Michael
_______________________________________________
applescript-users mailing list | email@hidden
Help/Unsubscribe/Archives:
http://www.lists.apple.com/mailman/listinfo/applescript-users
Do not post admin requests to the list. They will be ignored.