Implementasi dan Visualisasi Interaktif Algoritma Sorting Serta Analisis Performa Berbasis Python

Authors

  • Syuhada Simbolon Universitas Negeri Medan, Indonesia
  • Micael Zecsen Saragih Universitas Negeri Medan, Indonesia
  • Dwi Nina P Anakampun Universitas Negeri Medan, Indonesia
  • Khairida Octavia Ramadhani Universitas Negeri Medan, Indonesia

DOI:

https://doi.org/10.57235/smash.v3i1.8270

Keywords:

Algoritma sorting, visualisasi interaktif, Bubble Sort, Selection Sort, Insertion Sort, , Quick Sort, Python

Abstract

Algoritma sorting merupakan salah satu materi dasar dalam ilmu komputer yang digunakan untuk mengurutkan data. Namun, dalam proses pembelajarannya, mahasiswa sering mengalami kesulitan dalam memahami cara kerja algoritma secara langsung karena penyampaian yang cenderung bersifat teoritis. Oleh karena itu, penelitian ini bertujuan untuk mengimplementasikan serta memvisualisasikan algoritma sorting secara interaktif agar lebih mudah dipahami. Pada penelitian ini digunakan beberapa algoritma sorting, yaitu Bubble Sort, Selection Sort, Insertion Sort, dan Quick Sort yang diimplementasikan menggunakan bahasa pemrograman Python. Sistem yang dibuat dilengkapi dengan fitur visualisasi berbentuk grafik batang, pengaturan jumlah data, kontrol kecepatan animasi, mode step-by-step, serta analisis performa berupa jumlah perbandingan dan pertukaran data. Hasil pengujian menunjukkan bahwa penggunaan visualisasi interaktif sangat membantu dalam memperjelas tahapan algoritma yang sebelumnya sulit dipahami. Berdasarkan analisis performa pada dataset kecil ($n=5$), Insertion Sort mencatat waktu eksekusi paling optimal dibandingkan algoritma lainnya. Meski demikian, hasil penelitian juga menegaskan bahwa Quick Sort tetap menunjukkan potensi efisiensi yang lebih baik untuk penanganan skala data yang lebih kompleks sesuai dengan landasan teoritisnya. Secara keseluruhan, sistem ini tidak hanya efektif sebagai media pembelajaran, tetapi juga mampu menjadi alat bantu analisis perbandingan algoritma bagi pengguna.

Downloads

Download data is not yet available.

References

Y. Song, F. Tang, W. Dong, and C. Xu, “Non-dominated sorting based multi-page photo collage,” Comput. Vis. Media (Beijing)., vol. 8, no. 2, pp. 199–212, Jun. 2022, doi: 10.1007/s41095-021-0221-0.

M. Subramaniam, T. Tripathi, and O. Chandraumakantham, “Cluster Sort: A Novel Hybrid Approach to Efficient In-Place Sorting Using Data Clustering,” IEEE Access, vol. 13, pp. 74359–74374, 2025, doi: 10.1109/ACCESS.2025.3564380.

Z. Sitorus, D. Prayogi, M. A. Rizko, A. G. Suteja, and M. R. Harahap, “Implementation of the Insertion Sort Algorithm to Sort Positive Integers in Ascending Order Using Flowgorithm,” Journal of Information Technology, computer science and Electrical Engineering (JITCSE), vol. 1, no. 3, pp. 323–328, 2024, doi: 10.30596/jitcse.

F. R. Wibowo and M. Faisal, “Comparative Analysis of Sorting Algorithms: TimSort Python and Classical Sorting Methods,” Jurnal Informatika dan Sains), vol. 07, no. 01, 2024.

N. S. Aljerjawi and S. S. Abu-Naser, “Improving Sorting Algorithms Using Artificial Intelligence: A Cross Tactic,” 2025. [Online]. Available: www.ijeais.org/ijaisr

F. A. D.E. and D. O. Kurniawati, “Penggunaan Algoritma Sorting Bubble Sort Untuk Penentuan Nilai Prestasi Siswa,” SISTEMASI, vol. 8, no. 2, p. 296, May 2019, doi: 10.32520/stmsi.v8i2.493.

D. Rosdiana, “Implementasi Algoritma Quick Sort dalam Sistem Pemesanan Makanan di Rumah Makan,” vol. 1, no. 2, [Online]. Available: https://jurnal.komputasi.org/index.php/jst/article/view/28

I. P. Sari, F. Ramadhani, and O. K. Sulaiman, “Implementation of the Selection Sort Algorithm to Sort Data in PHP Programming Language,” Journal of Computer Science, Information Technology and Telecommunication Engineering, vol. 4, no. 1, Mar. 2023, doi: 10.30596/jcositte.v4i1.14362.

A. Ghofur et al., “Penerapan Algoritma Insertion Sort Pada Aplikasi Pengolahan Data Mahasiswa Menggunakan Java Di Fakultas Sains Dan Teknologi Prodi Teknologi Informasi,” Eastasouth Journal of Positive Community Services, vol. 4, no. 01, pp. 12–19, 2025, doi: 10.58812/ejpcs.v4i01.

R. Ayazuddin, “A Comprehensive Study of Sorting Algorithm Performance Using Real-World Dataset Metrics,” Sep. 30, 2025. doi: 10.20944/preprints202509.2550.v1.

Downloads

Published

2026-04-16

How to Cite

Simbolon, S., Saragih, M. Z., Anakampun, D. N. P., & Ramadhani, K. O. (2026). Implementasi dan Visualisasi Interaktif Algoritma Sorting Serta Analisis Performa Berbasis Python. SMASH: Journal of Social Management Sains and Health, 3(1), 35–43. https://doi.org/10.57235/smash.v3i1.8270

Issue

Vol. 3 No. 1 (2026): April 2026

Section

Articles

Citation Check

License

  1. Authors certify that the work reported here has not been published before and contains no materials the publication of which would violate any copyright or other personal or proprietary right of any person or entity.
  2. Authors dont transfer or license the copyright of publishing to SMASH: Journal of Social Management Sains and Health Research to publish the article in any media format, to share, to disseminate, to index, and to maximize the impact of the article in any databases.
  3. Authors hereby dont agree to transfer a copyright for publishing to SMASH: Journal of Social Management Sains and Health Publisher of the manuscript. 
  4. Authors reserve the following: 
    1. all proprietary rights other than copyright such as patent rights; 
    2. the right to use all or part of this article in future works of our own such as in books and lectures;
    3. use for presentation in a meeting or conference and distributing copies to attendees; 
    4. use for internal training by author's company;
    5. distribution to colleagues for their research use;
    6. use in a subsequent compilation of the author's works;
    7. inclusion in a thesis or dissertation;
    8. reuse of portions or extracts from the article in other works (with full acknowledgement of final article);
    9. preparation of derivative works (other than commercial purposes) (with full acknowledgement of final article); and
    10. voluntary posting on open web sites operated by author or author’s institution for scholarly purposes, but it should follow the open access license of Creative Common CC BY-NC License.