New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Broken sort #11

Open

highcliff opened this issue Oct 29, 2017 · 0 comments

highcliff commented Oct 29, 2017 •

edited

Loading

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?!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment