EUVIMEDEUVIMED entdecken
Crossref

KOMPARASI KECEPATAN ALGORITMA SEQUENTIAL DAN BINARY SEARCH BERBASIS VECTOR C++ PADA DATA TERURUT DAN ACAK

Raesya Satria Mikaelana, Fakhrul Arhabur Rizqi, Delviera Gea Florida, Aisyah Nur Ramadhani, Armaylis Arfa, Imam Prayogo Pujiono

Jurnal Informatika Kaputama (JIK) · 06.07.2026 · 10 (2) · 213-222

DOI: 10.59697/jik.v10i2.1366 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Jurnal Informatika Kaputama (JIK), online erschienen am 06.07.2026. Verfasst von Raesya Satria Mikaelana und 5 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This study aims to compare the computational time efficiency between the Sequential Search and Binary Search algorithms implemented using a dynamic data structure (vector) in the C++ programming language . The test focused on a small-scale dataset consisting of 98 random integer elements . The experiment was conducted through two main scenarios, namely searching in unsorted and sorted data conditions, by taking the average execution time of 50 iterations to maintain consistency . The test results show that in the unsorted data condition, Sequential Search is more efficient with an execution time of 4.25 µs . This is significantly faster than Binary Search, which takes a total of 15.40 µs due to the additional computational overhead of sorting the data at the beginning of the execution . Conversely, on sorted data, Binary Search is highly optimal thanks to its logarithmic search space division mechanism, recording an execution time of only 0.85 µs compared to Sequential Search (3.90 µs) . This study concludes that Binary Search is the best algorithm for sorted data, while Sequential Search is more practical and superior for small-scale datasets that have not been organized as it avoids pre-processing.

Zitieren

APA

Mikaelana, R. S., Rizqi, F. A., Florida, D. G., Ramadhani, A. N., Arfa, A., & Pujiono, I. P. (2026). KOMPARASI KECEPATAN ALGORITMA SEQUENTIAL DAN BINARY SEARCH BERBASIS VECTOR C++ PADA DATA TERURUT DAN ACAK. Jurnal Informatika Kaputama (JIK), 10(2), 213-222. https://doi.org/10.59697/jik.v10i2.1366

Vancouver

Mikaelana RS, Rizqi FA, Florida DG, Ramadhani AN, Arfa A, Pujiono IP. KOMPARASI KECEPATAN ALGORITMA SEQUENTIAL DAN BINARY SEARCH BERBASIS VECTOR C++ PADA DATA TERURUT DAN ACAK. Jurnal Informatika Kaputama (JIK). 2026;10(2):213-222. doi:10.59697/jik.v10i2.1366

BibTeX
@article{Mikaelana2026,
  author = {Mikaelana, Raesya Satria and Rizqi, Fakhrul Arhabur and Florida, Delviera Gea and Ramadhani, Aisyah Nur and Arfa, Armaylis and Pujiono, Imam Prayogo},
  title = {KOMPARASI KECEPATAN ALGORITMA SEQUENTIAL DAN BINARY SEARCH BERBASIS VECTOR C++ PADA DATA TERURUT DAN ACAK},
  journal = {Jurnal Informatika Kaputama (JIK)},
  year = {2026},
  volume = {10},
  number = {2},
  pages = {213--222},
  doi = {10.59697/jik.v10i2.1366}
}
Kostenlos starten →