Revision as of 15:28, 25 September 2004 edit Ayman (talk \| contribs) 119 edits Implementation in pseudocode ← Previous edit		Revision as of 15:53, 25 September 2004 edit undo Ayman (talk \| contribs) 119 edits m →Implementation in pseudocode: arr -> a Next edit →
Line 46: '''while''' (end >= 0) swap(a[end], a[0]) sift(~~arr~~a, 0, end) end := end - 1

Heapsort: Difference between revisions