Mohammed, Adnan SaherAmrahov, Sahin EmrahCelebi, Fatih, V2024-09-292024-09-2920212215-0986https://doi.org/10.1016/j.jestch.2021.02.009https://hdl.handle.net/20.500.14619/4905The exponential increase in the rate of data size is much higher than the increase in the speed of the computer, which has given much focus to search algorithms in the research literature. Finding an item in an ordered dataset is an efficient method in the data processing. However, binary and interpolation algorithms are commonly used to search ordered datasets in many applications. In this paper, we propose a hybrid algorithm for searching ordered datasets based on the idea of interpolation and binary search. The proposed algorithm is called Interpolated Binary Search (IBS). It is well known that the performance of traditional interpolation search depends specifically on key distribution, and its performance degrades significantly in non-uniform distributed datasets. Therefore, our proposed algorithm works efficiently on various distribution datasets. In particular, IBS aims to search datasets of unknown distribution or data sets that change dynamically and produce a dynamic distribution. Experimental results show that IBS performs better compared to other algorithms that use a similar approach. (C) 2021 Karabuk University. Publishing services by Elsevier B.V.eninfo:eu-repo/semantics/openAccessBinary searchInterpolation searchHybrid searchAdaptive searchInterpolation binary searchArticle10.1016/j.jestch.2021.02.0092-s2.0-8510327706110795Q1107224WOS:000672103600003Q1