× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.


  1.  Home
  2. RPG400-L
  3. August 2006

Re: Bsearch for closest match

The number of steps in the binary search is less, but each step is more complicated. In a small sample the lineal search is faster, in a large sample the binary is faster. The problem is "how big is big enough?" 
It depends on the algorithm.
__________________________________________________________________________________________
Jon Paris wrote:
>> I have always thought that these lookups were pretty darn fast anyway, 
They are - but everything is relative.  If you have 1,000 elements, then the
average number of comparisons to determine hit/miss is 500, and the worst
case is 1,000.  If you use a binary search the _worst_ case is less than 20.
That's a substantive difference.  Does it matter?  Depends how often you do
it and how time critical the task is.

Jon Paris
Partner400
www.Partner400.com

As an Amazon Associate we earn from qualifying purchases.

This thread ...
Replies:
Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.