Skip to content
Research Article Open access CC BY 4.0

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

Wirawan Istiono, Istiono, Wirawan

Asian Journal of Research in Computer Science · pp. 34–41 · Published 12 May 2023

10.9734/ajrcos/2023/v15i4328

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.

Binary search execution time identity number on identity card interpolation search loop time searching algorithm

References (17)

  1. 1 Advances in Sparrow Search Algorithm: A Comprehensive Survey [DOI]
  2. 2 Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection [DOI]
  3. 3 A bearing fault diagnosis model based on CNN with wide convolution kernels [DOI]
  4. 4 Understanding the determinants of maternal mortality: An observational study using the Indonesian Population Census [DOI]
  5. 5 A binary moth search algorithm based on self-learning for multidimensional knapsack problems [DOI]
  6. 6 Improved binary gaining–sharing knowledge-based algorithm with mutation for fault section location in distribution networks [DOI]
  7. 7 Efficiently Searching In-Memory Sorted Arrays [DOI]
  8. 8 Comparison Searching Process of Linear, Binary and Interpolation Algorithm [DOI]
  9. 9 Non-blocking interpolation search trees with doubly-logarithmic running time [DOI]
  10. 10 A fast interpolation-based multi-objective evolutionary algorithm for large-scale multi-objective optimization problems [DOI]
  11. 11 A Hybrid STA Based on Nelder–Mead Simplex Search and Quadratic Interpolation [DOI]
  12. 12 Dynamic Interpolation Search revisited [DOI]
  13. 13 Hybrid multi-agent optimization method of interpolation search [DOI]
  14. 14 A Novel Binary Search Tree Method to Find an Item Using Scaling [DOI]
  15. 15 Paw Search – A Searching Approach for Unsorted Data Combining with Binary Search and Merge Sort Algorithm [DOI]
  16. 16 Comparative Analysis of Brute Force and Boyer Moore Algorithms in Word Suggestion Search [DOI]
  17. 17 A Comparative Study of Cocktail Sort and Insertion Sort [DOI]

Cited by 1

Motion Path Study Based on Dynamic Simulation and Pitch Optimization Algorithm

Ying Shi, Guoyue Liu, Xiaohong Hao · 2024 IEEE 2nd International Conference on Electrical, Automation and Computer Engineering (ICEACE) · 2024

Article metrics

Real usage data collected on this platform.

11

Page views

0

PDF downloads

1

Outbound clicks

1

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.