Sorting algorithms/Heapsort: Difference between revisions

Line 169:
IF j< last DO
{ LET y = v!(j+1) // y = key of the other son.
IF x<y DO x,j := y, j+1 // j, x = subscript and key of larger son.
}
 
Line 201:
}
</lang>
 
 
=={{header|C}}==