STRING (Satuan Tulisan Riset dan Inovasi Teknologi)
Vol 8, No 2 (2023)

Perbandingan Algoritma Binary Search dan Sequential Search untuk Pencarian Persediaan Stok Barang Berbasis Web

Ramadhan, Hanzhalah (national university)
Fauziah, Fauziah (Universitas Nasional)
Lantana, Dhieka Avrilia (Universitas Nasional)



Article Info

Publish Date
05 Dec 2023

Abstract

Inventory of goods is one of the most important assets of a company. So. there must be good internal handling for the large amount of data items in the warehouse. At this time, the existing system of goods reporting is still conducted manually. This can result in errors in data storage. Therefore, it is necessary to develop a website application for inventory that can help users to more easily store and find the items needed. The application is the one using binary search and sequential search algorithms for the process of searching for goods data to speed up data search. This study compares the binary search and sequential search algorithms. The testing process uses microtime to produce the fastest time. The results of the test carried out 50 times out of 500 data show binary search produced an average time of 0.0402524 ms and sequential search of 0.0519893 ms. Then, the next test uses the searching time complexity method with the best case with a binary search algorithm of 0.0125 ms and a sequential search of 0.11293 ms. The conclusion is that using the binary search algorithm has the fastest time compared to the sequential search algorithm.

Copyrights © 2023






Journal Info

Abbrev

STRING

Publisher

Subject

Computer Science & IT Mathematics

Description

STRING (Satuan Tulisan Riset dan Inovasi Teknologi) focuses on the publication of the results of scientific research related to the science and technology. STRING publishes scholarly articles in Science and Technology Focus and Scope Covering: 1. Computing and Informatics 2. Industrial Engineering ...