TY - JOUR
TI - ANALISIS KOMPLEKSITAS WAKTU DAN RUANG TERHADAP LAJU PERTUMBUHAN ALGORITMA HEAPSORT (Time and Space Complexity Analysis for Heapsort Algorithm Growth Rate)
AU - Irianto, Sony; Mustafidah, Hindayati
IS - Vol 7, No 2 (2006)
PB - BIOMATH
JO - BIOMATH
PY - 2006
UR - http://jurnal.ump.ac.id/index.php/biomath/article/view/225
AB - This research addresses to get time and space complexity analysis model of heapsort algorithm depending to its graphical and mathematic analysis growth rate. To get the time and steps for sorting the data used computer program with programming language Turbo C++ ver 3.0. The program run at three computers with specifications as follows: Processor Intel Pentium 166 RAM 32M Cache Memory 512Kbyte, AT-386 Cache 256 Kbyte RAM 8 MB, and AT-486 Cache 256Kbyte RAM 16 MB, and a printer. Conclusion that reaches of this research is that heapsort algorithm is one of the algorithm sorting methods that has a high speed level with procces time O(n log n) of the complexity and sorting time speed level to sort data. Analysis results of the various data condition, sum of data, and data setting, this algorithm has a consistance time complexity. The results of the observation based on data table, sorting procces speed, and proccess time growth graphically, this algorithm has an up consistance proccess time of sum data.Keywords: algorithm, heapsort, time proccess, complexity analyze.