EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Optimization of Data Search Process Using a Combination of Merge Sort and Binary Search

Dimas Rizky Aulia, Faris Andisa, Hafid Nasrullah, Firdiawan Hermawan

Fast in Technologies and AI Solutions · 08.10.2025 · 1 (1) · 28-35

DOI: 10.66601/ftas.v1i1.10 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Fast in Technologies and AI Solutions, online erschienen am 08.10.2025. Verfasst von Dimas Rizky Aulia und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The growth in data volume in the digital age makes speed in processing and searching for information an increasingly important need. This research focuses on optimizing the data search process by comparing two algorithm combination strategies. The first strategy combines recursive Merge Sort with manual Binary Search, while the second strategy uses iterative (bottom-up) Merge Sort paired with the lower bound function from the C++ library. This research employs a quantitative experimental approach by testing execution times on random datasets of 1,000, 10,000, and 100,000 elements. The test results show that bottom-up Merge Sort has faster execution times compared to the recursive version, for example, 71.2 ms versus 107.2 ms for a dataset of 100,000 elements. This speed is achieved because the iterative approach does not require calling recursive functions, which can add to the memory load. For the search process, manual Binary Search proved to be very fast for a one-time search. However, in a repeated search scenario, the lower bound function is more efficient and consistent in execution time. The combination of bottom-up Merge Sort and lower bound becomes the optimal choice for large-scale systems that require a one-time sorting process and repeated searches, such as search engines and massive data filters. This research concludes that selecting an algorithm strategy appropriate for the frequency and needs of the search can improve system efficiency in processing large-scale data.

Zitieren

APA

Aulia, D. R., Andisa, F., Nasrullah, H., & Hermawan, F. (2025). Optimization of Data Search Process Using a Combination of Merge Sort and Binary Search. Fast in Technologies and AI Solutions, 1(1), 28-35. https://doi.org/10.66601/ftas.v1i1.10

Vancouver

Aulia DR, Andisa F, Nasrullah H, Hermawan F. Optimization of Data Search Process Using a Combination of Merge Sort and Binary Search. Fast in Technologies and AI Solutions. 2025;1(1):28-35. doi:10.66601/ftas.v1i1.10

BibTeX
@article{Aulia2025,
  author = {Aulia, Dimas Rizky and Andisa, Faris and Nasrullah, Hafid and Hermawan, Firdiawan},
  title = {Optimization of Data Search Process Using a Combination of Merge Sort and Binary Search},
  journal = {Fast in Technologies and AI Solutions},
  year = {2025},
  volume = {1},
  number = {1},
  pages = {28--35},
  doi = {10.66601/ftas.v1i1.10}
}
Kostenlos starten →