Analysis of Binary Search with the Decrease and Conquer Method Using Java NetBeans
DOI:
https://doi.org/10.59934/jiibd.v1i3.2510Abstrak
Binary Search is one of the most fundamental and efficient algorithms in computer science, operating on the principle of Decrease and Conquer. This literature review systematically examines the theoretical foundations, variations, complexity characteristics, and practical applications of Binary Search. By analyzing a wide range of academic studies and textbooks, this paper discusses the algorithmic structure, pseudocode, step-by-step illustrations, and time complexity proofs of Binary Search. Additionally, the review explores variants such as Interpolation Search and Exponential Search that extend the core binary search paradigm. The review further investigates real-world applications in database indexing, information retrieval, and software engineering. Results from the literature confirm that Binary Search achieves O(log n) time complexity, making it significantly more efficient than linear search for large sorted datasets. This review aims to provide a comprehensive reference for researchers and practitioners interested in search algorithm design and analysis
Unduhan
Referensi
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.
Levitin, A. (2012). Introduction to the Design and Analysis of Algorithms (3rd ed.). Pearson.
Sedgewick, R., & Wayne, K. (2011). Algorithms (4th ed.). Addison-Wesley.
Schildt, H. (2019). Java: The Complete Reference (11th ed.). McGraw-Hill Education.
Dharmawan, R., & Pratama, A. (2023). Analisis penerapan algoritma binary search pada sistem pencarian data berbasis Java. Jurnal Teknologi Informasi dan Komputer, 7(2), 45-52.
Prasetyo, D. A. (2022). Implementasi algoritma binary search dalam pencarian data mahasiswa menggunakan Java. Jurnal Informatika dan Rekayasa Perangkat Lunak, 4(1), 33-40.
Rahman, F., & Wijaya, H. (2021). Analisis kompleksitas algoritma binary search pada pengolahan data terurut. Jurnal Sistem Informasi dan Teknologi, 5(3), 101-108.
Sari, N. P. (2024). Perbandingan linear search dan binary search dalam proses pencarian data. Jurnal Ilmu Komputer dan Teknologi Informasi, 9(1), 12-19.
Fitriyani, A., Achmad, A. H., Lestari, D., & Fitriawati, N. (2025). Penerapan algoritma binary search pencarian data pada sistem supply barang. JSI (Jurnal Sistem Informasi) Universitas Suryadarma.
Knuth, D. E. (1998). The Art of Computer Programming, Volume 3: Sorting and Searching (2nd ed.). Addison-Wesley.
Horowitz, E., Sahni, S., & Rajasekaran, S. (2008). Fundamentals of Computer Algorithms (2nd ed.). Universities Press.
Weiss, M. A. (2012). Data Structures and Algorithm Analysis in Java (3rd ed.). Pearson.
Unduhan
Diterbitkan
Cara Mengutip
Terbitan
Bagian
Lisensi
Hak Cipta (c) 2026 Jurnal Inovasi Informatika dan Bisnis Digital (JIIBD)
Artikel ini berlisensiCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
