SEQUENTIAL VS. BINARY BATCHED SEARCHING.

被引：0

作者：

Manolopoulos, Y. ^{[1
]}

Kollias, J.G. ^{[1
]}

Hatzopoulos, M. ^{[1
]}

机构：

[1] Univ of Thessaloniki, Thessaloniki, Greece, Univ of Thessaloniki, Thessaloniki, Greece

来源：

| 1600年 / 29期

关键词：

COMPUTER PROGRAMMING - Algorithms;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 analyzed 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.

引用