Efficient hybrid search algorithm on ordered datasets

TL;DR

This paper introduces a hybrid search algorithm combining interpolation and binary search techniques, optimized for unknown ordered datasets, demonstrating improved performance over existing methods.

Contribution

The paper presents a novel hybrid search algorithm called Hybrid Search (HS) that enhances search efficiency on unknown distributed ordered datasets.

Findings

HS outperforms traditional search algorithms in experiments

The algorithm is effective on datasets with unknown distributions

Experimental results show improved search times

Abstract

The increase in the rate of data is much higher than the increase in the speed of computers, which results in a heavy emphasis on search algorithms in research literature. Searching an item in ordered list is an efficient operation in data processing. Binary and interpolation search algorithms commonly are used for searching ordered dataset in many applications. In this paper, we present a hybrid algorithm to search ordered datasets based on the idea of interpolation and binary search. The proposed algorithm called Hybrid Search (HS), which is designed to work efficiently on unknown distributed ordered datasets, experimental results showed that our proposed algorithm has better performance when compared with other algorithms that use a similar approach.