Sequential vs. Binary Batched Searching

Open Access
Publisher Website
Google Scholar
Abstract
This study considers an ordered array of N keys and estimates the required number of key comparisons to locate M requested keys when a binary search is performed to find each key. The problem is analysed for the cases where the M requests (a) are performed individually on a First Come First Served basis, and (b) are treated as a batch. For the second case a break point is established which indicates whether it is preferable to apply binary or sequential search for a batch of M keys.

This publication has 0 references indexed in Scilit: