SORTING ALGORITM COMPLEXITY ANALYSIS WITH THE MOST FINANCIED STUDY PROGRAM IN UNIMED
Keywords:
Sorting algorithms, complexityAbstract
Algorithms are a sequence of steps to solve problems, especially in programming. Sequencing algorithms, such as Bubble Sort, Selection Sort, and Insertion Sort, play a role in sorting data at different time speeds. The complexity of time becomes an important parameter for evaluating the efficiency of the algorithm. The study applied a sequencing algorithm to determine the most-demanded study program at the State University of the Field based on the number of followers. The results showed that Primary School Teacher Education was the highest-desired study program with 3273 followers after being sorted using Bubble Sort and Selection Sort. Selection sort proved to be 41.64% faster and more efficient than bubble Sort, highlighting the important role of sequencings in software development.
References
Abdullah, M. F., Hafiza, I., Wahyuni, R., & Syahputra, A. (2023). Penggunaan Algoritma Bubble Sort dalam Pengurutan Nomor Induk Mahasiswa. HELLO WORLD JURNAL ILMU KOMPUTER, 2(1), 14-19. https://doi.org/https://doi.org/10.56211/helloworld.v2i1.206
Astuti, Y. A. (2023). Analisis Pengujian Data Algoritma Bubble Sort. Remik: Riset Dan E-Jurnal Manajemen Informatika Komputer, 7(3). https://doi.org/10.33395/remik.v7i3.12594
Mahrozi, N., & Faisal, M. (2023). Nanang+Mahrozi. Jurnal Ilmiah Sain Dan Teknologi, 1(2), 89–98.
Saputr, & Yahfizham. (2023). Analisis Study Komperatif Bubble Sort Dan Selection Sort Pada Algoritma Dan Pemograman Berdasarkan Seleksi Pengurutan . Jurnal Arjuna: Publikasi Ilmu Pendidikan, Bahasa dan Matematika, 1(6), 151-161. https://doi.org/https://doi.org/10.61132/arjuna.v1i6.305
Sari, N., Gunawan, W. A., Sari, P. K., Zikri, I., & Syahputra, A. (t.t.). Analisis Algoritma Bubble Sort Secara Ascending Dan Descending Serta Implementasinya Menggunakan Bahasa Pemrograman Java.
Setyantoro, D., & Hasibuan, R. A. (2020). ANALISIS DAN PERBANDINGAN KOMPLEKSITAS ALGORITMA EXCHANGE SORT DAN INSERTION SORT UNTUK PENGURUTAN DATA MENGGUNAKAN PYTHON. TEKINFO , 21(1), 48-56.
Sunandar, E. (2019). Perbandingan Metode Selection Sort dan Insertion Sort dalam Pengurutan Data Menggunakan Bahasa Program Java. PETIR: Jurnal Pengkajian dan Penerapan Teknik Informatika, 12(2), 172-178
Tobing, F. A., & J. R. (2020). Analisis Perbandingan Efisiensi Algoritma Brute Force dan Divide and Conquer dalam Proses Pengurutan Angka. ULTIMATICS, XII(1), 52-58. https://doi.org/10.31937/ti.v12i1.1585
Yulian, D., Saputra, R., Andryana, S., Sholihati, I. D., Fakultas, ), Komunikasi, T., Informatika, D., Nasional, U., Sawo Manila, J., Minggu, P., Selatan, J., Khusus, D., & Jakarta, I. (t.t.). ANALISIS PERBANDINGAN ALGORITMA BUBBLE SORT DAN SELECTION SORT PADA SISTEM PENDUKUNG KEPUTUSAN PEMILIHAN TEMPAT KOST BERBASIS IOS (IPHONE OPERATING SYSTEM).
Downloads
Published
Issue
Section
License
Copyright (c) 2023 Adidtya Perdana, Mei Lammi Malau, Sanri Yuliana Siallagan, Silvia Wulandari Situngkir, Steviana Viviola Wicesti
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
