Research Article Open Access

Comparative Performance Study of Improved Heap Sort Algorithm on Different Hardware

Vandana Sharma1, Satwinder Singh1 and K. S. Kahlon1
  • 1 ,
Journal of Computer Science
Volume 5 No. 7, 2009, 476-478

DOI: https://doi.org/10.3844/jcssp.2009.476.478

Submitted On: 15 July 2008
Published On: 31 July 2009

How to Cite: Sharma, V., Singh, S. & Kahlon, K. S. (2009). Comparative Performance Study of Improved Heap Sort Algorithm on Different Hardware . Journal of Computer Science, 5(7), 476-478. https://doi.org/10.3844/jcssp.2009.476.478

Abstract

Problem statement: Several efficient algorithms were developed to cope with the popular task of sorting. Improved heap sort is a new variant of heap sort. Basic idea of new algorithm is similar to classical Heap sort algorithm but it builds heap in another way. The improved heap sort algorithm requires nlogn-0.788928n comparisons for worst case and nlogn-n comparisons in average case. This algorithm uses only one comparison at each node. Hardware has impact on performance of an algorithm. Since improved heap sort is a new algorithm, its performance on different hardware is required to be measured. Approach: In this comparative study the mathematical results of improved heap sort were verified experimentally on different hardware. To have some experimental data to sustain this comparison five representative hardware were chosen and code was executed and execution time was noted to verify and analyze the performance. Results: Hardware impact was shown on the performance of improved heap sort algorithm. Performance of algorithm varied for different datasets also. Conclusion: The Improved Heap sort algorithm performance was found better as compared to traditional heap sort on different hardware, but on certain hardware it was found best.

Download

Keywords

  • Complexity
  • performance of algorithms
  • sorting