Implementasi Stack dan Array pada Pengurutan Lagu dengan Metode Selection Sort
Abstract
A song is a work of art combined between sound art in which there is a melody and color of the singer's voice with language art. The number of songs nowadays requires a program that can sort songs to make it easier for users to find songs. This article aims to apply stack and array data structures to sort songs with the selection sort algorithm method in the hope that it can make it easier for users to find songs. In addition, this article aims to compare whether the selection sort algorithm is faster than insertion sort or vice versa. In making this journal, a literature study research method was carried out to deepen the material to be used in the project. The results of the program that has been made are that users can choose between adding songs, searching for songs, displaying songs that are already in the list, sorting songs, and exiting the program. With this, users can access and add their favorite songs anywhere and anytime. The conclusion of the results obtained is that selection sort is faster than insertion sort.
Downloads
References
Octaviani, S. & Nurfauziah, N., “Menelaah makna tersembunyi dalam lirik lagu ‘Istirahat’ Nosstress,” JURRIBAH, vol. 2(1), 146-157, April, 2023, https://doi.org/10.55606/jurribah.v2i1.1152
Mulyana, A. et al. (2021). Cara mudah mempelajari algoritma dan struktur data (Cetakan Pertama). DIVA Press. https://www.researchgate.net/publication/361248827_Cara_Mudah_Mempelajari_Algoritma_dan_Struktur_Data
Retnoningsih, E., “Algoritma pengurutan data (sorting) dengan metode insertion sort dan selection sort,” INFORMATION MANAGEMENT FOR EDUCATORS AND PROFESSIONALS, vol. 3(1), 95-106, Desember, 2018, http://101.255.92.196/index.php/IMBI/article/view/1060
Sihombing, J., “Penerapan stack dan queue pada array dan linked list dalam java,” INFOKOM, vol. 7(2), 15-24, Desember, 2019, https://www.journal.piksi.ac.id/index.php/INFOKOM/article/view/160
Selamet, R., “Implementasi struktur data list, queue dan stack dalam java,” Media Informatika, vol. 15(3), 18-25, 2016, https://jurnal.likmi.ac.id/Jurnal/11_2016/112016_03_Rachmat.pdf
Santosa, R., Sari, P. A., & Sasongko, A. T., “Sistem monitoring suhu dan kelembaban berbasis IoT (Internet of thing) pada gudang penyimpanan PT Sakafarma Laboratories,” JTEKSIS, vol. 5(4), 391-400, Oktober, 2023, https://doi.org/10.47233/jteksis.v5i4.943
Hindriani, N., Narwen, & Yozza, H., “Implementasi antrian dengan menggunakan array,” Jurnal Matematika UNAND, vol. 3(4), 147-151, 2014, https://doi.org/10.25077/jmu.3.4.147-151.2014
Benardo, Mesterjon, & Zulita, L. N., “Implementasi metode selection sort untuk menentukan nilai prestasi siswa kelas 3 dan kelas 4 SD Negeri 107 Seluma”, Jurnal Media Infotama, vol. 11(1), 91-100, Februari, 2015, https://doi.org/10.37676/jmi.v11i1.256
Putra, J. D., Ananda, M. R., Syahputra, A., Nurshabillah, & Sinaga, S. P., “Pengurutan menggunakan metode selection sort pada sistem informasi lokasi kontrakan di kota Medan berbasis Android,” Blend Sains Jurnal Teknik, vol. 1(4), 259-266, Januari, 2023, https://doi.org/10.56211/blendsains.v1i4.184
Hakim, F. Z., “Implementasi metode selection sort untuk menentukan barang yang harus di stok ulang dalam sistem informasi penjualan,” Journal Information Engineering and Educational Technology, vol. 1(1), 18-26, 2017, https://journal.unesa.ac.id/index.php/jieet/article/download/668/542
Harahap, F. & Effendy, I., “Implementasi algoritma selection sort dalam membangun aplikasi android pemesanan jasa make-up Palembang,” Jurnal JUPITER, vol. 15(1), 61-72, April, 2023, https://jurnal.polsri.ac.id/index.php/jupiter/article/download/5208/2586
Farah A. D. E. & Kurniawati, D. O., “Penggunaan algoritma selection sort untuk menentukan nilai tertinggi siswa,” JURNAL SISTEM & TEKNOLOGI INFORMASI KOMUNIKASI, vol. 6(2), 23-26, 2023, https://doi.org/10.32524/jusitik.v6i2.961
Zailani, A. U., Apriyanto, B., & Zakaria, H. (2020). Struktur data (Cetakan Pertama). Unpam Press. https://repository.unpam.ac.id/8871/1/TPL0113_STRUKTUR%20DATA.pdf
Maulana, R., “Analisa perbandingan kompleksitas algoritma selectionsort dan insertionsort,” INFORMATIKA, vol. 3, 208-218, September, 2016, https://ejournal.bsi.ac.id/ejurnal/index.php/ji/article/view/810
Sunandar, E., “Perbandingan metode selection sort dan insertion sort dalam pengurutan data menggunakan bahasa program java,” PETIR, vol. 12(2), 172-178, September, 2019, https://doi.org/10.33322/petir.v12i2.485
Kusumaningrum, A., “Perbandingan kecepatan antara selection sort, insertion sort, dan bubble sort,” TEKNOMATIKA, vol. 3(1), 63-70, Juli, 2020, https://ejournal.unjaya.ac.id/index.php/teknomatika/article/download/363/311/
Gultom, D. I., “Analisis perbandingan penggunaan algoritma pengurutan data dengan metoda bubble sort, metoda selection sort, metoda insertion sort,” Jurnal Tekinkom, vol. 1(1), 8-13, Juni, 2018, https://doi.org/10.37600/tekinkom.v1i1.47
Loebis, R. A. A., “Lagu, kaum muda dan budaya demokrasi,” PUSTAKA, vol. 18(2), 81-85, Juni, 2020, https://doi.org/10.24843/PJIIB.2018.v18.i02.p02
Hartanti, N. T., & Astuti, Y. (2018) Algoritma struktur data. Universitas AMIKOM Yogyakarta. http://materi.amikom.ac.id/2020/10/25102020_Modul%20Teori%20Algoritma%20Struktur%20Data.pdf
Jadoon, S., Solehria, S. F., & Qayum, M., “Optimized selection sort slgorithm is faster than insertion Sort algorithm: a comparative study,“ International Journal of Electrical & Computer Sciences IJECS-IJENS, vol. 11(2), 18-23, 2011, https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=20960a569bacc4ef9d7a3266fc5e73dfa93c265c
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under an Attribution 4.0 International (CC BY 4.0) that allows others to share — copy and redistribute the material in any medium or format and adapt — remix, transform, and build upon the material for any purpose, even commercially with an acknowledgment of the work's authorship and initial publication in this journal.
