Year: 2025
Type: article
Abstract: This article analyzes three major search algorithms: linear, binary, and interpolation search. Each algorithm's working principle, efficiency, and performance on large datasets are examined. Experimental results show that linear search takes significantly longer than the dataset grows, while binary and interpolation searches perform much faster. The interpolation search algorithm demonstrates the best efficiency due to its mathematical estimation formula, which allows it to locate elements more accurately in sorted data. Overall, the study concludes that interpolation search provides superior performance compared to binary and linear search algorithms when handling large-scale datasets.
Institution: Asia International University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7219955039