0001 template <typename T> void PQ_ComplHeap<T>::heapify ( Rank n ) { //Floyd建堆算法,O(n)时间 0002 for ( int i = LastInternal ( n ); InHeap ( n, i ); i-- ) //自底而上,依次 0003 percolateDown ( n, i ); //下滤各内部节点 0004 }