Analisis Kompleksitas Ruang dan Waktu Terhadap Laju Pertumbuhan Algoritma Heap Sort, Insertion Sort dan Merge dengan Pemrograman Java
(1) Universitas Indraprasta PGRI
(*) Corresponding Author
Abstract
The role of the algorithms in software or programming is very important, so it is necessary to understand the basic concepts of the algorithm. Study the implementation and performance of the sorting process using heap sort, insertion sort and merge sort algorithms. The research method for the first stage, the three algorithms are implemented to sort the numbers made by the user, in the second stage the source code for the three algorithms is changed to be able to sort randomly generated numbers with as many numbers as the request from the user. To find out how well the performance in sorting the data, then in the last stage the three algorithms sort random numbers with a predetermined vulnerable number and then the results are compared. Experiments that have been carried out and based on the analysis, heap sort is one of the data sorting methods that are classified as having a high speed, where the complexity and speed of the sorting time needed for the sorting process uses insertion sort and merge sort algorithms which show less consistency in the complexity of time and space. Based on the results of tables and data on the amount of data, shows that the heap sort algorithm gives a very consistent processing time in increasing the processing time to the amount of data.
Keywords
Full Text:
PDFReferences
C. A. Akhyati, A. Johar, B. Susilo, Perangkat Lunak Pendukung Pembelajaran Algoritma Heap Sort. Bengkulu: Universitas Bengkulu, 2014.
Ardi, A. Wijaya, dan F. N. Noris, Aplikasi Simulasi Pengurutan Data Menggunakan Algoritma Heap Sort. Bengkulu: Universitas Muhammadiyah Bengkulu, 2015.
O. Goldreich, “Computational Complexity: A Conceptual Perspective”. New York: Cambridge University Press, 2008.
S. Irianto, dan H. Mustafidah, Analisis Kompleksitas Waktu dan Ruang Terhadap Laju Pertumbuhan Algoritma Heap Sort. Purwokerto: Universitas Muhammadiyah Purwokerto, 2006.
A. H. Saptadi, dan D. W. Sari, Analisis Algoritma Insertion Sort, Merge Sort dan Implementasinya Dalam Bahasa Pemrograman C++. Palembang: Universitas Sriwijaya Palembang, 2012.
R. Hibbler, “Merge Sort”, Dept. Of Computer Science. Florida Institute of Technology. Florida, USA. 2008.
Saputra, dkk. 2010. Analisis Algoritma Rekursif Quick Sort (http://www.mediafire.com/download/py3q5jevwp59vj/DAA+2010+IF32_01+Analisis+Algoritma+Rekursif+Quick+Sort.pdf, diakses 31 Januari 2017)
V. Sharma, S. Singh, K. S. Kahlon, 2008. “Performance Study of Improved Heap Sort Algorithm and Other Sorting Algorithms on Different Platforms”. India: Department of Computer science & Engineering Chitkara Institute of Engg. & Technology.
Suarga. “Algoritma Pemrograman”. Yogyakarta: Andi, 2012.
Tjaru, dan B. N. Setia, 2010. “Kompleksitas Algoritma Pengurutan Selection Sort dan Insertion Sort”. Makalah IF2091 Strategi Algoritmik Tahun 2009
(http://informatika.stei.itb.ac.id/~rinaldi.muir/Matdis/20092010/Makalah0910/MakalahStrukdis0910074.pdf, diakses 31 Januari 2017)
Yahya, dan Y. Sofyansyah, 2014. “Analisa Perbandingan Algoritma Bubble Sort dan Selection Sort Dengan Metode Perbandingan Eksponensial”. Jurnal Pelita Informatika Budi Darma, Volume 6, Nomor 3. (http://pelita-informatika.com/berkas/jurnal/28.%20Sofyansayah.pdf, diakses 31 Januari 2017)
DOI: http://dx.doi.org/10.30998/string.v5i2.6250
Refbacks
- There are currently no refbacks.
Copyright (c) 2020 rizki rizkyatul basir
This work is licensed under a Creative Commons Attribution 4.0 International License.
STRING (Satuan Tulisan Riset dan Inovasi Teknologi) indexed by:
Ciptaan disebarluaskan di bawah Lisensi Creative Commons Atribusi 4.0 Internasional.
View My Stats