Abstract

In computer, execution time is critical, and knowing which algorithm and programming language will perform better, among other things will save programmers time and effort. The purpose of this work is to compare three searching algorithms: Binary, Jump, and Interpolation, which are implemented in three object-oriented programming languages: C++, Java, and Python using execution time. Data size, algorithm style, and programming languages were used to compare the execution times of these searching methods. A time stamp was utilized to determine the search algorithm's execution time. The results demonstrate that among the programming languages tested, C++ is faster than Java and Python in terms of execution. Interpolation search is also the algorithm with the shortest execution time for vast amounts of data, followed by Binary search and the Jump search method. It was discovered that the size of the data and the programming language employed have an impact on the execution time. As a result, this paper offers guidance on selecting a search algorithm and the type of programming language to be used. In the current age of explosive increase in the use of searching for data or information on a device, this is done in order to minimize the execution time of a searching algorithm.