Sorting algorithms/Counting sort: Difference between revisions

Content added Content deleted
m (→‎version 1: added/changed whitespace and comments.)
Line 1,778: Line 1,778:
Negative, zero, and positive integers are supported.
Negative, zero, and positive integers are supported.
===version 1===
===version 1===
<lang rexx>/*REXX program sorts an array using the count─sort algorithm. */
<lang rexx>/*REXX program sorts an array using the count─sort algorithm. */
$=1 3 6 2 7 13 20 12 21 11 22 10 23 9 24 8 25 43 62 42 63 41 18 42 17 43 16 44 15 45 14 46 79 113 78 114 77 39 78 38
$=1 3 6 2 7 13 20 12 21 11 22 10 23 9 24 8 25 43 62 42 63 41 18 42 17 43 16 44 15 45 14 46 79 113 78 114 77 39 78 38
#=words($); do j=1 for #
#=words($); w=length(#); do i=1 for #
@.j=word($,j) /*assign a Recaman # from a list.*/
@.i=word($,i) /*get a Recaman # from a list.*/
end /*j*/ /* [↑] assign 40 Recaman numbers*/
end /*i*/
call show@ 'before sort: ' /*show the before array elements.*/
call show 'before sort: ' /*show the before array elements. */
call countSort # /*sort # entries of the @. array.*/
say copies('▒',55) /*show a pretty separator line. */
call show@ ' after sort: ' /*show the after array elements.*/
call countSort # /*sort a number of entries of @. array.*/
exit /*stick a fork in it, we're done.*/
call show ' after sort: ' /*show the after array elements. */
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────COUNTSORT subroutine────────────────*/
/*────────────────────────────────────────────────────────────────────────────*/
countSort: procedure expose @.; parse arg N; L=@.1; h=L; _.=0; x=1
do j=1 for N; z=@.j; _.z=_.z+1; L=min(L,@.j); h=max(h,@.j); end /*j*/
countSort: procedure expose @.; parse arg N; L=@.1; h=L; _.=0; x=1
do k=L to h; do x=x for _.k; @.x=k; end /*x*/; end /*k*/
do j=1 for N; z=@.j; _.z=_.z+1; L=min(L,@.j); h=max(h,@.j); end /*j*/
do k=L to h; do x=x for _.k; @.x=k; end /*x*/; end /*k*/
return
return
/*────────────────────────────────────────────────────────────────────────────*/
/*──────────────────────────────────SHOW@ subroutine────────────────────*/
show@: do s=1 for #; say right("element",20) right(s,length(#)) arg(1) @.s
show: do s=1 for #; say right("element",20) right(s,w) arg(1) @.s; end; return</lang>
end /*s*/
say copies('▒',55) /*show a pretty separator line. */
return</lang>
'''output'''
'''output'''
<pre style="height:50ex">
<pre style="height:50ex">
Line 1,880: Line 1,878:
element 39 after sort: 113
element 39 after sort: 113
element 40 after sort: 114
element 40 after sort: 114
▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒
</pre>
</pre>


Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Counting_sort"