Perbandingan Kecepatan Pencarian Antara Binary Search Tree dan Array
Abstract
This study compares the search speed between Binary Search Tree (BST) and Array in various scenarios. Through a series of experiments using the Java programming language, we analyze their performance in ordered, random, and reverse data situations. The results show that in the case of sorted data, Array has an advantage in searching. However, on random data, BST provides faster and more stable search results. For reversed data, Array is also superior in terms of search speed. The resulting recommendation is to use BST for searching in complex random data, while Array is more suitable for sorted or reversed data. Understanding these comparisons can help developers choose data structures that match application needs and optimize search performance.
Downloads
References
Holle, K. F. H., M.Kom. (2022). Modul Praktikum Struktur Data. Universitas Islam Negeri Maulana Malik Ibrahim Malang.
Pribadi, A., Kurniawan, F., Hariadi, M., & Nugroho, S. M. S. (2017). Urban Distribution CCTV for Smart City Using Decision Tree Methods. In Proceedings of the 2017 International Seminar on Intelligent Technology and Its Application (pp. 21-24). Institut Teknologi Sepuluh Nopember (ITS) Surabaya.
Prayoga Permana, A., Ainiyah, K., & Holle, K. F. H. (2021). Analisis Perbandingan Algoritma Decision Tree, kNN, dan Naive Bayes untuk Prediksi Kesuksesan Start-up. Jurnal Ilmu Sistem dan Komputer Asia (JISKa), 6(3), 178-188. ISSN: 2527-5836 (print) | 2528-0074 (online).
Copyright (c) 2023 Zidan Firdaus Tirta
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work’s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal’s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
