算法导论6.5-3

HEAP-MINIMUM(A)  
1    return A[1]  
HEAP-EXTRACR-MIN(A)  
1    if heap-size[A] < 1  
2        then error "heap underflow"  
3    min =A[1]  
4    A[1] = A[heap-size[A]]  
5    heap-size[A] = heap-size[A] - 1  
6    MIN-HEAPIFY(A, 1)  
7    return min  
HEAP-DECREASE-KEY(A, i, key)  
1    if key > A[i]  
2        then error "new key is smaller than current key"  
3    A[i] = key  
4    while i > 1 and A[PARENT(i)] > A[i]  
5        do exchange A[i] <-> A[PARENT(i)]  
6              i = PARENT(i)  
MIN-HEAP-INSERT  
1    heap-size[A] <- heap-size[A] + 1  
2    A[heap-size[A]] <- 0x7fffffff  
3    HEAP-INCREASE-KEY(A, heap-size[A], key)