Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
added FunL
(added FunL) |
(added FunL) |
||
Line 923:
while end > 0
a(end), a(0) = a(0), a(end)
siftDown( a, 0, end )▼
def heapify( a ) =
def siftDown( a, start, end ) =
|