Analisis Perbandingan Ruang dan Waktu pada Algoritma Sorting Menggunakan Bahasa Pemrograman Python

Yayan Heryanto(1*), F Fauziah(2), Trinugi Wira Harjanti(3),

(1) Universitas Nasional
(2) Universitas Nasional
(3) Sekolah Tinggi Teknologi Informasi NIIT, Indonesia
(*) Corresponding Author

Abstract


The role of algorithms in software or programming is very important, so understanding the basic concepts of these algorithms is essential. A lot of programming logic has been made, and in sorting data, insertion sort, quick sort, bubble sort, selection sort, and merge sort algorithms have been used. If you get random data with values of 200, 300, 400, and 500, using the manual method will take a long time, so the five algorithms are used with the Python programming language to sort random data of integer data type. The time required and the size of memory used in each algorithm will be examined during the sorting process. An effective algorithm is one that has a short processing time and uses little memory, so that in this journal, the results for the time efficiency of the Quick Sort algorithm are superior, namely with inputs of 200, 300, 400, and 500, it takes 0.001 seconds, 0.001 seconds, 0.003 seconds, and for memory usage, the Bubble Sort algorithm is superior because it only requires a small amount of memory.

Full Text:

PDF

References


Muhammad Ezar Al Rivan, "Perbandingan Kecepatan Gabungan Algoritma Utama Quick Sort Dan Merge Sort Dengan Algoritma Tambahan Insertion Sort, Bubble Sort Dan Selection Sort", Jurnal Teknik Informatika Dan Sistem Informasi Volume 3 Nomor 2 Agustus 2017, E-Issn : 2443-2229.

Arief Hendra Saptadi And D. W. Sari, “Analisis Algoritma Insertion Sort, Merge Sort Dan Implementasinya Dalam Bahasa Pemrograman C++,” Vol. 8, Pp. 1–8, 2012.

R. Hibbler, “Quick Sort,” Dept. Comput. Sci. Florida Inst. Technol. Florida, Usa., 2008.

P. Sareen, “International Journal Of Advanced Research In Computer Science And Software Engineering Comparison Of Sorting Algorithms ( On The Basis Of Average Case ),” Int. J. Adv. Res. Comput. Sci. Softw. Eng., Vol. 3, No. 3, Pp. 522–532, 2013.

W. Min, "Analysis On Bubble Sort Algorithm Optimization", 2010 International Forum On Information Technology And Applications, Ieee, 2010.

R. Edjlal, A. Edjlal, T. Moradi, "A Sort Implementation Comparing With Bubble Sort And Selection Sort", Pp 380-381, Ieee, 2011.

W. Xiang, "Analysis Of The Time Complexity Of Quick Sort Algorithm" Pp 408 - 410, Ieee, 2011.

J. Hammad, A Comparative Study Between Various Sorting Algorithms", Vol.15 No.3, Pp 11-16, March 2015. [5] Dwipo Setyantoro, Rika Astuti Hasibuan, "Analisis Dan Perbandingan Kompleksitas Algoritma Exchange Sort Dan Insertion Sort Untuk Pengurutan Data Menggunakan Python", Tekinfo Vol. 21 No. 1, April 2020.

M. F. Sanner, "Python: A Programming Language For Software Integration And Development", The Scripps Research Institute 10550 North Torrey Pines Road, La Jolla, Ca-92037.

Abidin, Taufik Fuadi. 2008. Struktur Data. Informatika. Universitas Syah Kuala Banda Aceh.

Karve, S. Insertion Sort Example. Http://Www.Dreamincode.Net/Code/Snippet279.Htm.

Rahayuningsih, P. 2016. Analisis Perbandingan Kompleksitas Algoritma Pengurutan Nilai (Sorting). Jurnal Evolusi. No.4, Vol.1, 64–75.

Verma, M., Dan Chowdhary, K. R. 2018. Analysis Of Energy Consumption Of Sorting Algorithms On Smartphones. Proceedings Of 3rd International Conference On Internet Of Things And Connected Technologies (Iciotct). No.3, Vol.89, 472-475.

Chauhan, Y., Dan Duggal, A. 2020. Different Sorting Algorithms Comparison Based Upon The Time Complexity. International Journal Of Research And Analytical Reviews. No.3, Vol.7, 114-121.

Kumar, S., & Singla, P. 2019. Sorting Using A Combination Of Bubble Sort, Selection Sort & Amp; Counting Sort. International Journal Of Mathematical Sciences And Computing. No.2, Vol.




DOI: https://doi.org/10.30645/kesatria.v4i2.169

DOI (PDF): https://doi.org/10.30645/kesatria.v4i2.169.g168

Refbacks

  • There are currently no refbacks.


Published Papers Indexed/Abstracted By: