HEAP-INCREASE-KEY(A,i,key)
1 if key < A[i]
2 error “new key is smaller than current key”
3 A[i] = key
4 while i > 1 and A[parent(i)] < A[i]
5 exchange A[i] with A[parent(i)]
6 i=parent(i)
MAX-HEAP-INSERT(A,key)
1 A.heapsize = A.heapsize + 1
2 A[A.heapsize] = -infinity{largest negative number that can be represent in our platform}
3 HEAP-INCREASE-KEY(A,A.heapsize,key)
Illustrate the operation of MAX-HEAP-INSERT$(A,10)$ on the heap $A=\langle 15,13,9,5,12,8,7,4,0,6,2,1 \rangle$.
