Analisis Algoritma Sequential Search Pada Aplikasi Pencarian Berita

Mhd Furqan(1*), A Armansyah(2), Riski Askia Kurniawan(3),

(1) Universitas Islam Negeri Sumatra Utara, Indonesia
(2) Universitas Islam Negeri Sumatra Utara, Indonesia
(3) Universitas Islam Negeri Sumatra Utara, Indonesia
(*) Corresponding Author

Abstract


The algorithm is an approach to be able to compile and manage data efficiently. The Sequential Search algorithm is used to build a mobile-based news search application. The search function is used to validate the data itself. The Sequential Search algorithm has 2 possibilities, namely the best possibility (best case) and the worst case (worst case). In determining a possibility, it takes the complexity of the time algorithm. This study will analyze the Sequential Search algorithm in determining the 2 possibilities that occur in mobile applications. Data is one of the things needed in the development of an application. There are 100 data used by researchers as keywords and researchers will take 5 keywords, namely Earthquake, PDI, Indonesian Education, Floods, and Online Sales to determine the best case and worst case from the Sequential Search algorithm. In determining the speed of time required running time program in units of milliseconds (ms). So that the average time for the earthquake keyword is 0.014189 ms, the PDI keyword is 0.073763 ms, the Indonesian Education keyword is 0.169640 ms, the Flood keyword is 0.206307 ms, and the Online Selling keyword is 0.284086 ms. By obtaining the time from the test, the results of the complexity are also obtained, namely Tmin(n) = 0.014189 ms so that the best case is found in the Earthquake keyword and Tmax(n) = 0.284086 ms so that the worst case is found in the Online Selling keyword. And Tavg(n) = 0.1491375 ms. News API is HTTP REST API which is used to access news after keywords are found

Full Text:

PDF

References


Y. Religia, 2019, “Analisis Algoritma Sequential Search Dan Binary Search Pada Big Data,” J. Ilm. Inform. Arsit. dan Lingkung., vol. 14, no. 1, 74–79.

W. S. Wahyuni, S. Andryana, and B. Rahman, 2022, “Penggunaan Algoritma Sequential Searching Pada Aplikasi Perpustakaan Berbasis Web,” JIPI (Jurnal Ilm. Penelit. dan Pembelajaran Inform., vol. 7, no. 2, 294–302.

A. Srirahayu and F. Suryani, 2021, “Implementasi Algoritma Sequential Search Pada Aplikasi Ensiklopedia Dermatologi berbasis Mobile,” J. Ilm. Rekam Medis dan Inform. Kesehat., vol. 11, no. 1, 49–53.

M. H. Pristyawan, 2018, “Analisis Algoritma Sequential Search Untuk Mencari Data Mahasiswa Teknik Informatika Pada Sekolah Tinggi Teknologi Pelita Bangsa,” Sekolah Tinggi Teknologi Pelita Bangsa.

R. R. Hada and E. F. Hariadi, 2020, “Analisa Perbandingan Hasil Text Mining Dengan Fitur Tf ldf dan SQL Like Operator Pada Pencarian Berita berbahasa Indonesia,” JOINCS (Journal Informatics, Network, Comput. Sci., vol. 3, no. 1, 1–11.

H. Umam, S. Hardienata, and A. Chairunnas, 2018, “Impelementasi Algoritma Pencarian Sequential Search Pada Ensikloperia Ikan Hias Air Tawar Berbasis Android,” ilmu komput, 1–12.

D. Markuci and C. Prianto, 2022, “Analisis Perbandingan Penggunaan Algoritma Sequential Search Dan Binary Search Pada Aplikasi Surat Perjalanan Dinas,” JATI (Jurnal Mhs. Tek. Inform., vol. 6, no. 1, 110–119.

N. Imamah and M. I. Bahari, 2021, “Perbandingan Algoritma Sequential Search Dan Algoritma Binary Search Pada Aplikasi Kamus Bahasa Indonesia Menggunakan Php Dan Jquery,” J. Inform., vol. 08. 1–6.

A. Sonita and M. Sari, 2018, “Implementasi Algoritma Sequential Searching Untuk Pencarian Nomor Surat Pada Sistem Arsip Elektronik,” J. Pseudocode, vol. 5, no. 1, 1–9




DOI: http://dx.doi.org/10.30645/jurasik.v8i2.622

DOI (PDF): http://dx.doi.org/10.30645/jurasik.v8i2.622.g595

Refbacks

  • There are currently no refbacks.



JURASIK (Jurnal Riset Sistem Informasi dan Teknik Informatika)
Published Papers Indexed/Abstracted By:

Jumlah Kunjungan : View My Stats