Implementasi dan Analisis Algoritma Binary Search
Keywords:
Binary Search, Search Algorithm, Time Complexity, Implementation, Case StudyAbstract
The Binary Search algorithm is an extremely efficient search method for finding elements within a sorted array. This research aims to analyze the basic concepts, implementation, and advantages of this algorithm compared to linear search methods. With a time complexity of O(log n), Binary Search significantly reduces the number of elements inspected in each iteration through its logarithmic approach. The implementation of this algorithm is demonstrated through programming languages, and a case study of searching for book titles in a digital library is used as a practical example. The analysis results show that Binary Search offers high efficiency, particularly in scenarios involving large, well-structured data sets. This knowledge will open up opportunities to develop faster, more efficient and more reliable software solutions in various application fields
Downloads
Downloads
Published
How to Cite
Issue
Section
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.
