Broken sort

[highcliff]

re: RosettaCodeData/Task/Sorting-algorithms-Heapsort/Pascal/sorting-algorithms-heapsort.pascal

Initialise the array to these values:
data: TIntArray = (11, 9, 4, 7, 13, 10, 6, 6, 12, 10, 7, 7);
and this is the result:

The data before sorting:
11 9 4 7 13 10 6 6 12 10 7 7
The data after sorting:
4 6 6 7 7 7 9 10 12 10 11 13

Does that look right to you?!