Rosetta Code

Sorting algorithms/Heapsort: Difference between revisions

Page Discussion

Sorting algorithms/Heapsort (view source)

Revision as of 23:42, 3 January 2015

6 bytes removed ,  9 years ago
Nimrod -> Nim
(added a novice-package version for Forth)
(Nimrod -> Nim)
Line 1,742:
</pre>
 
=={{header|NimrodNim}}==
<lang nimrodnim>proc siftDown[T](a: var openarray[T]; start, ending: int) =
var root = start
while root * 2 + 1 < ending:
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/120639"