heapsort

听听怎么读
英 [hi:p'sɔ:t]
美 [hip'sɔt]
是什么意思
  • 释义

    堆排序;

  • 英英释义

    Heapsort

    • 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.

    以上来源于:Wikipedia

    学习怎么用

    权威例句

    Heapsort
    Heapsort
    Heap-Sort
    Adaptive Heapsort
    The Analysis of Heapsort
    The analysis of heapsort
    Heaps and heapsort on secondary storage ☆
    Average-case results on heapsort
    On the Performance of WEAK-HEAPSORT
    On the Performance of WEAK-HEAPSORT
    A variant of heapsort with almost optimal number of comparisons
    BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)
    BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)
    h开头的单词
    词汇所属分类
    字母词汇表更多
    r开头的单词
    t开头的单词
    w开头的单词
    分类词汇表更多
    服务三农
    专四专八考试
    BEC
    人名姓氏表更多
    男/女
    雅思预测