Algorithm 2 Max Heap Delete

1: // a lazier and slower version

2:procedure MaxHeapDelete( $A, i$ )

3:HeapIncreaseKey( $A, i, \infty$ )

4:HeapExtractMax( $A$ )

5:end procedure

7: // a faster but more complex version

8:procedure MaxHeapDelete( $A, i$ )

9:if $A[i] > A[A.\text{heap-size}]$ then

10: $A[i] = A[A.\text{heap-size}]$

11:MaxHeapify( $A, i$ )

12:else

13:HeapIncreaseKey( $A, i, A[A.\text{heap-size}]$ )

14:end if

15: $A.\text{heap-size} = A.\text{heap-size} - 1$

16:end procedure