Find largest index from root , left and right child
if ( left < heapSize and index [ left ] > index [ largest ] ) : NEW_LINE INDENT largest = left NEW_LINE DEDENT if ( right < heapSize and index [ right ] > index [ largest ] ) : NEW_LINE INDENT largest = right NEW_LINE DEDENT if ( largest != i ) : NEW_LINE