Process of heap sort If root element is minimum than its both of the child then break
if ( heap [ index ] . CompareTo ( heap [ left1 ] ) <= 0 && heap [ index ] . CompareTo ( heap [ right1 ] ) <= 0 ) { break ; }