How to use the heap to sort:如何用堆来实现排序：
A: Continue to call delMax() after building a heap建堆后不断调用delMax()
B: Continue to call getMax() after building a heap建堆后不断调用getMax()
C: Continue to call insert() after building a heap建堆后不断调用insert()
D: Build the heap建堆
A: Continue to call delMax() after building a heap建堆后不断调用delMax()
B: Continue to call getMax() after building a heap建堆后不断调用getMax()
C: Continue to call insert() after building a heap建堆后不断调用insert()
D: Build the heap建堆
举一反三
- How to use the heap to sort:如何用堆来实现排序：- 未答 A: Continue to call delMax() after building a heap建堆后不断调用delMax() B: Continue to call getMax() after building a heap建堆后不断调用getMax() C: Continue to call insert() after building a heap建堆后不断调用insert() D: Build the heap建堆
- 名词解释：运行时堆（ runtime heap）
- C#程序能够使用的内存类型有三种，分别是（stack）、托管堆（managed heap）和非托管堆（unmanaged heap）。
- The time complexity of building a complete binary heap of size n by the Floyd build-heap algorithm is:Floyd建堆算法建立规模为n的完全二叉堆的时间复杂度为： A: O(nlgn) B: O(n) C: O(lgn) D: O(1)
- 堆(Heap)是( ) A: 完全二叉树 B: 线性表 C: 二叉排序树 D: 平衡二叉树