累计查询 0.00 亿次

heap sort

  • 堆排序：利用堆这种数据结构所设计的一种排序算法。堆是一个近似完全二叉树的结构，并同时满足堆的性质：即子节点的键值或索引总是小于（或者大于）它的父节点。

双语例句

  1. Heap Sort has the additional benefit of being quite consistent in its speed, so it is useful in programs where timing is crucial (i. e. networks).
    堆排序的另外一个好处是它的速度非常稳定，这让它得以在那些需要严格计时的程序中派上用场(例如网络)。
  2. Use appropriate indexes to minimize the use of the sort heap.
    使用合适的索引使排序堆的使用降到最低。
  3. It works the same way for sort heap, as we'll see in the sort heap section below.
    正如将在下面的排序堆一节中所看到的，它的工作方式与排序堆的相同。

网络短语

  • weak-heap sort
    弱堆排序法
  • heap sort program
    堆排序程序；堆分类程序
  • adaptive heap sort
    适应堆排序法
  • Heap-Sort
    堆排序
  • solid heap sort
    立体堆排序

英英释义

  • Heapsort is a comparison-based sorting algorithm to create a sorted array (or list), and is part of the selection sort family. Although somewhat slower in practice on most machines than a well-implemented quicksort, it has the advantage of a more favorable worst-case O(n log n) runtime.