It is great algorithm for searching, but insertions of course are much more
work. Like almost everything in programming, it is a trade off.
From: Bob Ebert <[EMAIL PROTECTED]> on 03/30/99 09:07 PM
Please respond to [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
cc: [EMAIL PROTECTED] (bcc: Mark Mascolino-MR/PGI)
Subject: Re: Search Times in DB
At 9:59 AM -0800 3/27/99, Ing. Martin HOPPEL wrote:
>has anybody information about search times in larger databases on palm
>III appr. 2-3MB and 15000 to 20000 records, and if there are some speed
>up possibilities
Sort the database. Then you can search it with binary search, using
DmFindSortPosition. Binary searching 20000 records only requires 15 key
comparisons max... that's the beauty of a log(n) algorithm!
--Bob
