Kombinasi Algoritma Sequential Searching dan Bubble Sort Pada Manajemen Laboratorium

Nur Arifin(1*), F Fauziah(2), N Nurhayati(3),

(1) Universitas Nasional
(2) Universitas Nasional
(3) Universitas Nasional
(*) Corresponding Author

Abstract


The facilities in the laboratory can make students especially feel comfortable because of several supports such as internet availability, better computer specifications, servers with large capacities as data storage media and rooms that support students' conditions in doing their assignments. During the pandemic, the laboratory cannot be used optimally because learning is done online. So that an online application for borrowing a laboratory is needed to maximize the function of the laboratory. In this study, a laboratory loan website application was designed by combining sequential search and bubble sort algorithms on the search engine menu so as to facilitate and speed up the process of searching for laboratory types. The test was carried out simultaneously from 700 test data and resulted in a time of 3 milliseconds for the sequential search algorithm, and 0.036 milliseconds for the bubble sort algorithm. While the results of the testing time with the combination of the two algorithms obtained are 4 milliseconds

Full Text:

PDF

References


T. R. Reno Sari, “Aplikasi Sistem Informasi Dan Manajemen Laboratorium,” 2017, p. 212.

D. Meidelfi and T. Lestari, “Aplikasi Peminjaman Laboratorium Pada Fakultas Teknologi Pertanian Universitas Andalas,” vol. 2, no. 2, pp. 42–47, 2021.

S. Suryaningsih, “Pengembangan Sistem Pengelolaan Administrasi Laboratorium Fisika UIN Walisongo Semarang Berbasis WEB,” pp. 1–11, 2017.

H. Pane, Fauziah, and Nurhayati, “Rancang Bangun Aplikasi Kraepelin Test Berbasis Web Menggunakan Metode Bubble Sort,” JOINTECS (Journal Inf. Technol. Comput. Sci., vol. 7, no. 1, pp. 41–48, 2018.

A. Sonita and F. Nurtaneo, “Analisis Perbandingan Algoritma Bubble Sort, Merge Sort, Dan Quick Sort Dalam Proses Pengurutan Kombinasi Angka Dan Huruf,” Pseudocode, vol. 2, no. 2, pp. 75–80, 2016, doi: 10.33369/pseudocode.2.2.75-80.

A. H. M. Susanto Susanto, “Management System Fertilizer Ship Arrival At UPP Semarang Based Website Using Sequential Searching Method,” IJCCS(Indonesian J. Comput. Cybern. Syst., vol. 15, no. 4, pp. 1–11, 2021, doi: 10.22146/ijccs.68204.

A. S. Gowtham, “one-dimensional array using ram based sorting algorithm,” vol. 7, no. 15, pp. 5904–5914, 2020.

M. H. M. Tonny, ibnu rasyid munthe, “Perancangan Aplikasi Pengenalan Tokoh Penemu Benda-benda Penting di Dunia Berbasis Android Menggunakan Metode Sequential Search,” MEANS (Media Inf. Anal. dan Sist., vol. 6, no. 1, pp. 90–94, 2021.

A. F. Dwi M J Purnomo, Ahmad Arinaldi, Dwi T Priyantini, Ari Wibisono, “Implementation Of Serial And Parallel Bubble Sort On Fpga,” J. Ilmu Komput. dan Inf., vol. 9, no. 2, p. 113, 2016.

H. Triansyah, “Implemetasi Metode Bubble Sort Dalam Pengurutan Indeks Prestasi Mahasiswa,” J. Ilm. Inform., vol. 7, no. 01, p. 48, 2019, doi: 10.33884/jif.v7i01.1003.

G. Gunawan, “Aplikasi Kamus Istilah Ekonomi (Inggris-Indonesia) Menggunakan Metode Sequential Searching,” Pseudocode, vol. 3, no. 2, pp. 122–128, 2017, doi: 10.33369/pseudocode.3.2.122-128.

A. Sonita and M. Sari, “Implementasi Algoritma Sequential Searching Untuk Pencarian Nomor Surat Pada Sistem Arsip Elektronik,” Pseudocode, vol. 5, no. 1, pp. 1–9, 2018, doi: 10.33369/pseudocode.5.1.1-9.

S. Tini, “Implementation of Sequential Search Method on Android-based Jakabaring Dictionary,” J. Transform., vol. 16, no. 1, p. 74, 2018, doi: 10.26623/transformatika.v16i1.830.

M. Utami and Y. Apridiansyah, “Implementasi Algoritma Sequential Searching Pada Sistem Pelayanan Puskesmas Menggunakan Bootstrap (Studi Kasus Puskesmas Kampung Bali Bengkulu),” JSAI (Journal Sci. Appl. Informatics), vol. 2, no. 1, pp. 81–86, 2019, doi: 10.36085/jsai.v2i1.166.

I. Pratama, “Virtual Parallel Environment Using Pvm Case Study Bubble Sort Algorithm,” Proxies J. Inform., vol. 1, no. 2, pp. 44–53, 2017, [Online]. Available: http://103.243.177.137/index.php/proxies/article/view/1248.

M. E. Al Rivan, “Perbandingan Kecepatan Gabungan Algoritma Quick Sort dan Merge Sort dengan Insertion Sort, Bubble Sort dan Selection Sort,” J. Tek. Inform. dan Sist. Inf., vol. 3, no. 2, pp. 319–331, 2017, doi: 10.28932/jutisi.v3i2.629.

A. R. Lipu, R. Amin, M. N. I. Mondal, and M. Al Mamun, “Exploiting parallelism for faster implementation of Bubble sort algorithm using FPGA,” ICECTE 2016 - 2nd Int. Conf. Electr. Comput. Telecommun. Eng., no. December, pp. 8–10, 2017, doi: 10.1109/ICECTE.2016.7879576.

S. Roma Rio, M. Yusman, and F. Febi Eka, “Implementasi Algoritma Bubble Sort Dan Selection Sort Menggunakan Arraylist Multidimensi Pada Pengurutan Data Multi Prioritas,” J. Komputasi, vol. 5, no. 1, pp. 81–87, 2017.




DOI: http://dx.doi.org/10.30645/j-sakti.v6i1.445

Refbacks

  • There are currently no refbacks.


J-SAKTI (Jurnal Sains Komputer & Informatika)
Published Papers Indexed/Abstracted By:

Jumlah Kunjungan :

View My Stats