...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of computer sciences >Comparative Performance Study of Improved Heap Sort Algorithm on Different Hardware
【24h】

Comparative Performance Study of Improved Heap Sort Algorithm on Different Hardware

机译：改进的堆排序算法在不同硬件上的比较性能研究

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：问题陈述：开发了几种有效的算法来应对流行的排序任务。改进的堆排序是堆排序的新变体。新算法的基本思想类似于经典的堆排序算法，但是它以另一种方式构建堆。改进的堆排序算法需要在最坏情况下进行nlogn-0.788928n比较，而在一般情况下需要nlogn-n比较。该算法在每个节点上仅使用一个比较。硬件会影响算法的性能。由于改进的堆排序是一种新算法，因此需要测量其在不同硬件上的性能。方法：在这项比较研究中，改进的堆排序的数学结果在不同的硬件上进行了实验验证。为了获得一些实验数据来维持这种比较，选择了五个有代表性的硬件并执行了代码，并记录了执行时间以验证和分析性能。结果：硬件影响显示了改进的堆排序算法的性能。对于不同的数据集，算法的性能也有所不同。结论：在不同的硬件上，与传统的堆排序相比，发现改进的堆排序算法性能更好，但在某些硬件上，发现的性能最好。

著录项

  • 来源
    《Journal of computer sciences》 |2009年第7期|p.476-478|共3页
  • 作者

    Vandana Sharma; Satwinder Singh; K.S. Kahlon;

  • 作者单位

    Department of Computer Science and Engineering,Chitkara Institute of Engineering and Technology, Jansla, Punjab, India;

    Department of Computer Science and Engineering and Information Technology,Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib, Punjab, India;

    Department of Computer Science and Engineering,Guru Nanak Dev University, Amritsar, Punjab, India;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    complexity; performance of algorithms; sorting;

    机译：复杂;算法性能;分类;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号