Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
m
→version 1: compressed assignments for array, changed DO loop indentatio, added/changed comments. -- ~~~~
m (→version 1: removed extra blanks lines from program, changed array header information (title) and added generic method for title header, added whitespace. -- ~~~~) |
m (→version 1: compressed assignments for array, changed DO loop indentatio, added/changed comments. -- ~~~~) |
||
Line 2,151:
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────HEAPSORT subroutine─────────────────*/
heapSort: procedure expose @.; parse arg n; do j=n%2 by -1 to 1
_=@.1; @.1=@.n;
▲ end /*n*/
return
/*──────────────────────────────────SHUFFLE subroutine──────────────────*/
shuffle: procedure expose @.; parse arg i,n; _=@.i
do while i+i<=n; j=i+i; k=j+1
@.i=_
return
/*──────────────────────────────────GEN@ subroutine─────────────────────*/
gen@: @.= /*assign default value for array.*/
@.1 = '---modern Greek alphabet letters---
@.2 = copies('=', length(@.1))
@.3 = 'alpha' ; @.11 =
@.4 = 'beta' ; @.12 =
@.5 = 'gamma' ; @.13 =
@.6 = 'delta' ; @.14 =
@.7 = 'epsilon' ; @.15 =
@.8 = 'zeta' ; @.16 =
@.9 = 'eta' ; @.17 =
@.10 = 'theta' ; @.18 =
@.11 = 'iota'
▲ do highItem=1 while @.highItem\=='' /*find how many entries. */
return
/*──────────────────────────────────SHOW@ subroutine────────────────────*/
show@:
say 'element' right(j,length(highItem)) arg(1)':'
end
▲ end /*j*/
say copies('─', 79) /*show a separator line. */
return</lang>
'''output''' using the Greek
<pre style="height:30ex;overflow:scroll">
element 1 before sort: ---modern Greek alphabet letters---
| |||