RE: Bsearch for closest match -- RPG400-L

Good News Everybody!

The new search engine is LIVE!

Please report any problems to david (at) midrange.com.

Subject: RE: Bsearch for closest match
From: "Jon Paris" <Jon.Paris@xxxxxxxxxxxxxx>
Date: Tue, 22 Aug 2006 18:21:24 -0400
List-archive: <http://archive.midrange.com/rpg400-l>
List-help: <mailto:rpg400-l-request@midrange.com?subject=help>
List-id: RPG programming on the AS400 / iSeries <rpg400-l.midrange.com>
List-post: <mailto:rpg400-l@midrange.com>
List-subscribe: <http://lists.midrange.com/mailman/listinfo/rpg400-l>, <mailto:rpg400-l-request@midrange.com?subject=subscribe>
List-unsubscribe: <http://lists.midrange.com/mailman/listinfo/rpg400-l>, <mailto:rpg400-l-request@midrange.com?subject=unsubscribe>

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

Follow-Ups:

Re: Bsearch for closest match , Raul A. Jager W.

This mailing list archive is Copyright 1997-2026 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.