我试图证明对于二进制堆,buildHeap最多(2N-2)在元素之间进行比较.我发现很难证明这一说法.
algorithm heap complexity-theory big-o binary-heap
algorithm ×1
big-o ×1
binary-heap ×1
complexity-theory ×1
heap ×1