Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
m
→version 1: added short-circuit IF (for optimization). -- ~~~~
m (→version 1: changed a comment. -- ~~~~) |
m (→version 1: added short-circuit IF (for optimization). -- ~~~~) |
||
Line 2,161:
shuffle: procedure expose @.; parse arg i,n; _=@.i
do while i+i<=n; j=i+i; k=j+1
if k<=n
if _>=@.j then leave
@.i=@.j; i=j
|