Perbandingan efisiensi algoritma linear search dengan algoritma binary search

Authors

  • Ahmad Zamroni Zamroni Teknik Informatika, Sains dan Teknologi, Universitas Islam Negri Maulana Malik Ibrahim Malang

Keywords:

Linear Search, Binary Search, Algorithm Efficiency, Time Complexity, Space Complexity

Abstract

Linear search and binary search are two commonly used algorithms in data processing. Linear search is known for its simplicity and ability to work with unsorted datasets, while binary search is more efficient for large, sorted datasets. This study compares the efficiency of both algorithms based on time complexity, space complexity, data conditions, and dataset size. The analysis results show that linear search is more suitable for small datasets or unsorted data, whereas binary search is significantly more efficient for large, sorted datasets. By understanding the characteristics of each algorithm, users can choose the most appropriate one for their specific needs.

Downloads

Download data is not yet available.

Downloads

Published

2025-06-26

How to Cite

Zamroni, A. Z. (2025). Perbandingan efisiensi algoritma linear search dengan algoritma binary search. Maliki Interdisciplinary Journal, 3(4), 86–92. Retrieved from https://urj.uin-malang.ac.id/index.php/mij/article/view/13620

Issue

Section

Articles