Speed Analysis of Binary Search and Interpolation Search for Searching Identification Numbers on National Identity Cards

Abstract

Aims: The purpose of the work is to make comparisons and find the best search algorithm between binary search and interpolation search algorithms for searching identity number on Indonesian identity cards.
 Study Design: This study was designed by implementing binary and interpolation algorithms into C language, with a dataset of 5000.
 Place and Duration of Study: Department of Informatic Universitas Multimedia Nusantara, between November 2022 until March 2023.
 Methodology: Binary algorithms and interpolation search will be tested by searching for identity number on identity card data, totaling 5000 data. To measure the level of speed and effectiveness of the two algorithms, this will be done by trying to search for data in various amounts, namely 1000, 2000 and 5000 data, with the data sought between the two algorithms having the same value. Testing is carried out by implementing the two algorithms into C language to get the number of loops and execution time, and testing of the algorithms on each sample dataset is carried out five times to get the average value of the test results.
 Results: The results of the tests that have been carried out between the binary search and interpolation search algorithms from the existing dataset, found that the number of loops in the interpolation loop is 36.57% better than the binary search algorithm, while for execution time, binary search has a faster execution speed of 12.43% than interpolation search.
 Conclusion: It can be concluded that if the dataset is large enough, such as identity card data on Indonesian citizens, and if the computer specifications are adequate, binary search, which has a faster execution time, should be used; however, if the computer specifications are inadequate, interpolation search, which has a smaller number of loop processes, should be used.