Optimasi Pengurutan Data Bilangan dengan Menggabungkan Algoritma Selection Sort Hybrid dan Bucket Sort

Authors

DOI:

https://doi.org/10.29408/edumatic.v7i1.12358

Keywords:

sorting algorithm, bucket sort, optimization, selection sort hybrid

Abstract

Sorting algorithms are crucial in data processing, particularly for integer data. However, as the number of integers to be sorted increases, the sorting algorithm takes longer to complete, especially for algorithms with O(n2) complexity. This article discusses optimizing integer data sorting by combining the Selection Sort Hybrid and Bucket Sort algorithms. The study aims to test the performance of the Selection Sort Hybrid and Bucket Sort algorithms and compare them with other data sorting algorithms. The research method used is experimental quantitative research, using randomly generated data using Python. The data were tested using the Combined Selection Sort Hybrid with Bucket Sort algorithm, Selection Sort Hybrid, Quick Sort, and Merge Sort. Data analysis was done by calculating the execution time of each sorting algorithm. The results show that the Selection Sort Hybrid and Bucket Sort algorithms are faster than other sorting algorithms in testing with large and complex integer data. Therefore, combining Selection Sort Hybrid and Bucket Sort algorithms can improve the efficiency and speed of sorting complex integer data.

References

Adline, F., Tobing, T., & Tambunan, J. R. (2020). Analisis Perbandingan Efisiensi Algoritma Brute Force dan Divide and Conquer dalam Proses Pengurutan Angka. Ultimatics: Jurnal Teknik Informatika, 12(1), 52-58. https://doi.org/10.31937/ti.v12i1.1585

Andri, A. (2019). Penerapan Algoritma Pencarian Binary Search dan QuickSort pada Aplikasi Kamus Bahasa Palembang Berbasis Web. Jurnal Informatika: Jurnal Pengembangan IT, 4(1), 70–74. https://doi.org/10.30591/jpit.v4i1.1104

Anggreani, D., Wibawa, A. P., Purnawansyah, P., & Herman, H. (2020). ). Perbandingan Efisiensi Algoritma Sorting dalam Penggunaan Bandwidth. ILKOM Jurnal Ilmiah, 12(2), 96–103. https://doi.org/10.33096/ilkom.v12i2.538.96-103

Arifin, R. W., & Setiyadi, D. (2020). Algoritma Metode Pengurutan Bubble Sort dan Quick Sort Dalam Bahasa Pemrograman C++. Information System For Educators And Professionals, 4(2), 178–187. http://www.ejournal binainsani.ac.id/index.php/ISBI/article/view/1348/1148

Chauhan, Y., & Duggal, A. (2020). Different sorting algorithms comparison based upon the time complexity. International journal of research and analytical reviews (IJRAR).,7(3), 114-121. https://www.ijrar.org/papers/IJRAR19L2026.pdf

Gill, S. K., Singh, V. P., Sharma, P., & Kumar, D. (2019). A comparative study of various sorting algorithms. International Journal of Advanced Studies of Scientific Research, 4(1). 367 -372 https://ssrn.com/abstract=3329410

Hardika, E., Atmaja, S., & Pinaryanto, K. (2020). Unjuk Kerja Selection Sort Hybrid 17. Jurnal Buana Informatika, 11(1), 17-25. https://doi.org/10.24002/jbi.v11i1.2699

Hasibuan, M. R. (2022). Implementasi Algoritma Quicksort Untuk Pembangkitan Kunci Algoitma RSA Pada Pengamanan Data Audio. Journal of Informatics, Electrical and Electronics Engineering, 2(1), 18-25. https://djournals.com/jieee

Hastomo, W., Satyo, A., Karno, B., Kalbuana, N., Nisfiani -4, E., & Etp -, L. (n.d.). . (2021). Optimasi Deep Learning untuk Prediksi Saham di Masa Pandemi Covid-19. JEPIN (Jurnal Edukasi dan Penelitian Informatika), 7(2), 133-140. http://dx.doi.org/10.26418/jp.v7i2.47411

Ilmu, F., Dan, T., Uin, K., & Utara, S. (2021). Algoritma Pemrograman Dan Notasi Tertulis Retrieved April 14, 2023, from osf.io website: https://osf.io/fg2ca/download

Kumar, P., Gangal, A., Kumari, S., & Tiwari, S. (2020). Recombinant sort: N-dimensional cartesian spaced algorithm designed from synergetic combination of hashing, bucket, counting and radix sort. Ingenierie Des Systemes d’Information, 25(5), 655–668. https://doi.org/10.18280/ISI.250513

Muslim Ramli. (2018). Analisis Kunci Singkat Dinamis Algoritma One Time Pad untuk Keamanan Pesan [Master’s thesis, Universitas Sumatra Utara]. Repositori Universitas Sumatra Utara. http://repositori.usu.ac.id/handle/123456789/8158

Nishom, M., & Fathoni, M. Y. (2018). . (2018). Implementasi Pendekatan Rule-Of-Thumb untuk Optimasi Algoritma K-Means Clustering. Jurnal Informatika: Jurnal Pengembangan IT, 3(2), 237-241. http://dx.doi.org/10.30591/jpit.v3i2.909

Puspita Sari, Y., Ali, R., & Rajasa, A. (2022). Perbandingan Efisiensi dengan Algoritma Sorting dalam Penentuan Jarak (Studi Kasus: Pet Shop di Bandar Lampung). TEKNIKA, 16(1), 149-159. https://jurnal.polsri.ac.id/index.php/teknika/article/view/4805

Rizka Poetra, D., & Hayati, N. (2022). Performa Algoritma Bubble Sort Dan Quick Sort Pada Framework Flutter Dan Dart SDK (Studi Kasus Aplikasi E-Commerce). JATISI (Jurnal Teknik Informatika Dan Sistem Informasi), 9(2), 806-816. https://doi.org/10.35957/jatisi.v9i2.1886

Rizkyatul Basir, R. (2020). Analisis kompleksitas ruang dan waktu terhadap laju pertumbuhan algoritma heap sort, insertion sort dan merge dengan pemrograman java. STRING (Satuan Tulisan Riset dan Inovasi Teknologi), 5(2), 109-118.http://dx.doi.org/10.30998/string.v5i2.6250

Sari, N., Gunawan, W. A., Sari, P. K., Zikri, I., & Syahputra, A. (2022). Analisis Algoritma Bubble Sort Secara Ascending Dan Descending Serta Implementasinya Menggunakan Bahasa Pemrograman Java. ADI Bisnis Digital Interdisiplin Jurnal, 3(1), 16-23. https://doi.org/10.34306/abdi.v3i1.625

Setyantoro, D., & Hasibuan, R. A. (2020 Analisis dan perbandingan kompleksitas algoritma exchange sort dan insertion sort untuk pengurutan data menggunakan python Tekinfo: Jurnal Bidang Teknik Industri dan Teknik Informatika, 21(1), 48-56. https://journals.upi-yai.ac.id/index.php/TEKINFO/article/view/1139

Syed Muqeet Aqib, Haque Nawaz, & Shah Muhammad Butt. (2021). Analysis of Merge Sort and Bubble Sort in Python, PHP, JavaScript, and C language. International Journal of Advanced Trends in Computer Science and Engineering, 10(2), 680–686. https://doi.org/10.30534/ijatcse/2021/311022021

Toyib, R., Darnita, Y., Ragil, A., & Deva, S. (2021). Penerapan Algoritma Binary Search Pada Aplikasi E-Order. Jurnal Media Infotama, 17(1), 30 – 37 https://doi.org/10.37676/jmi.v17i1.1314

Tumanggor, H. Y., Maya, R., Lubis, F., Sianturi, M. P., Purba, R. G., & Manajemen, A. (2022). Metode algoritma bubble sort, algoritma merge sort dan algoritma quick sort dalam pengujian perbandingan proses penelitian kualitatif. JUTISAL Jurnal Teknik Informatika Universal, 2(2), 47-58. https://universal.ac.id/jurnal/index.php/jutisal/article/view/28

Utari, L. (2022). “algoritma selection sort” “implementasi algoritma selection sort untuk pengurutan nilai ipk mahasiswa universitas potensi utama.” JTIK (Jurnal Teknik Informatika Kaputama), 6(2), 390-398. http://jurnal.kaputama.ac.id/index.php/JTIK/article/view/817

Wei, P., Huang, Z., Yang, X., & Jia, W. (2021). Fast adaptive phase unwrapping algorithm based on improved bucket sorting. Optics and Lasers in Engineering, 147(106745) 1 – 10 . https://doi.org/10.1016/J.OPTLASENG.2021.106745

Downloads

Published

2023-06-20