Comparative Analysis of Binary and Interpolation Search Algorithms on Integer Data Using C Programming Language

To perform data search, there are various algorithms that have been developed, such as binary search and interpolation search. There are various views on these two algorithms, regarding which one is better than the other. From the various views that have emerged, this study aims to find out which al...

Full description

Saved in:
Bibliographic Details
Published in:2023 International Conference on Information Management and Technology (ICIMTech) pp. 340 - 345
Main Authors: Saputra, Bima Andri, Candra, Stevans Calvin, Wijaya, Franis Berta, Suryaningrum, Kristien Margi, Saputri, Hanis Amalia
Format: Conference Proceeding
Language:English
Published: IEEE 24-08-2023
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:To perform data search, there are various algorithms that have been developed, such as binary search and interpolation search. There are various views on these two algorithms, regarding which one is better than the other. From the various views that have emerged, this study aims to find out which algorithm is more efficient in terms of time complexity and memory complexity using Big-O notation, as well as its execution time in the C programming language. This research was conducted with 6 datasets consisting of 3 datasets with uniform data types and 3 datasets with non-uniform data types. Each dataset type consists of 1 million, 10 million, and 100 million data. The results show that the binary search algorithm is more efficient to use rather than interpolation search on datasets that are not uniformly distributed or the data type is unknown. While the interpolation search algorithm is more efficient to use rather than binary search on datasets that are known to be uniformly distributed.
ISSN:2837-2778
DOI:10.1109/ICIMTech59029.2023.10277955