 Note that "A" is indexed starting at 1.For the above algorithm to correctly re-heapify the array, the node at index "i" and its two direct children must violate the heap property.If they do not, the algorithm will fall through with no change to the array.