Its been a while but bear with me and tell me if I am talking drivel... I guess on a modern machine its not a problem, but on an older environment with restricted memory and 4K page sizes then that is going to be around 10 pages. If the data is paged out and item you are looking for is in the first page a won't a binary search be the slowest as it will cause three paging operations to occur.....
Dave On 24 October 2013 11:50, Don Higgins <[email protected]> wrote: > All > > > > I see discussion about optimizing the binary search, but I don't see any > discussion about optimizing linear search which might make it much faster > than binary depending on the search history. Putting the last key found at > front of most recently used list or just holding last found as a first test > may result in significant reduction in total search compares if there are > frequent repeat requests. > > > > Don Higgins > > [email protected]
