Performance Analysis of Bubble Sort, Selection Sort, and Insertion Sort Algorithms Using Python on Student Data
Abstract
This study aims to analyze the performance of three fundamental sorting algorithms—Bubble Sort, Selection Sort, and Insertion Sort—implemented using the Python 3.12.10 programming language. The experiment was conducted using five dataset sizes consisting of student data with 50, 100, 150, 200, and 250 records. Each algorithm was tested under three data order conditions: random, nearly sorted, and reversed. The experimental results indicate that Insertion Sort achieved the most efficient execution time for nearly sorted data, averaging below one millisecond, while Bubble Sort exhibited the slowest performance, particularly on reversed data, with execution times exceeding 30 milliseconds. Selection Sort maintained consistent performance across conditions but remained slower than Insertion Sort in most cases. Overall, the empirical findings support the theoretical O(n²) time complexity and reinforce the learning of algorithm efficiency concepts in the Algorithm and Data Structure course of the Information Technology Study Program.
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/10.56211/helloworld.v2i1.206
Bawamenewi, D., Tanoto, C., Banjarnahor, J., Nababan, N. K., Purba, W., & Aisyah, S. (2022). Implementasi Metode Selection Sort Dalam Sistem Repository Skripsi. Jurnal Sistem Informasi Dan Ilmu Komputer Prima), 5(2).
Hassan, M., Muhammad, G., Malik, J. A., Akhtar, M., Baloch, M. A., & Rajwana, M. A. (2025). Sort Data Faster : Comparing Algorithms. 01(02), 28–37.
Iskandar, J., Suhendar, H., & Pamungkas, B. D. (2023). Analisis Strategi Algoritma Sorting Menggunakan Metode Komparatif pada Bahasa Pemrograman Java dengan Python. G-Tech: Jurnal Teknologi Terapan, 8(1), 104–113. https://doi.org/10.33379/gtech.v8i1.3556
Mahrozi, N, Faisal, M. (2023). Analisis Perbandingan Kecepatan Algoritma Selection Sort dan Bubble Sort. Scientica (Jurnal Ilmiah Sain Dan Teknologi), 1(2), 89–98.
Putra, Y. I., Kusmana, A., & Fitrah, Y. (2023). Falsifikasi sebagai pedoman Memahami Informasi di Media Sosial secara Objektif. Jurnal Inovasi Pendidikan Dan Teknologi Informasi (JIPTI), 4(2), 289–295. https://doi.org/10.52060/pti.v4i2.1515
Retnoningsih, E. (2018). Copyright@2018. P2M STMIK BINA INSANI INFORMATION MANAGEMENT FOR EDUCATORS AND PROFESSIONALS Algoritma Pengurutan Data (Sorting) Dengan Metode Insertion Sort dan Selection Sort. 3(1), 95–106.
Saputri Saputri, & Yahfizham 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/10.61132/arjuna.v1i6.305
Sedgewick, R. & Wayne, K. (2011). Algorithms (4th Edition). Addison-Wesley.
Sunandar, E. (2019). Perbandingan Metode Selection Sort dan Insertion Sort dalam Pengurutan Data Menggunakan Bahasa Program Java. 12(2).
Wirth, N. (1976). Algorithms + data structures = programs. Prentice Hall.
Yunial, A. H. (2025). Analisa Perbandingan Algoritma Bubble Sort, Insert Sort, dan Selection Sort. 10(1), 7–14. https://doi.org/10.32493/informatika.v10i1.44216
| Keywords | : |
Keywords:
Sorting Algorithm, Bubble Sort, Selection Sort, Insertion Sort, Python algoritma pengurutan, bubble sort, selection sort, insertion sort, Python, efisiensi algoritma
|
| Galleys | : | |
| Published | : |
2025-11-13
|
| How to Cite | : | |
| Issue | : |
Copyright (c) 2025 Gustina, Ahmad Husna Ahadi, Fattachul Huda Aminuddin, Muhammad Farhan Syawal
This work is licensed under a Creative Commons Attribution 4.0 International License.
_SCCC.png)
