Sorting algorithms/Bubble sort: Difference between revisions

<lang rexx>/*REXX program sorts an array (of any kind of items) using the bubble-sort algorithm.*/

call gen /*generate the array elements (items).*/

call show 'before sort' /*show the before array elements. */

say copies('─', 79) /*show a separator line (before/after).*/

call bubbleSort # /*invoke the bubble sort with # items.*/

call show ' after sort' /*show the after array elements. */

exit /*stick a fork in it, we're all done. */

bubbleSort: procedure expose @.; parse arg n; m=n-1 /*N: number of array elements. */

m=n-1 do until ok; ok=1 /*use this as a handy variable for sort /*keep sorting array until done.*/

do until done; done=1 do j=1 /*keep sortingfor them; array untilk=j+1; done if @.j<=@.k then iterate /*Not out-of-order?*/

do j=1 for m _=@.j; @.j=@.k; @.k=j+1_; ok=0 /*searchswap for2 anelements; elementflag as out─of─order. ¬done*/

if @.j>@.k then do; _=@.j /*Out ofend order? Then swap two elements/*j*/

end @.j=@.k /*swap current element with theuntil next···ok*/

gen: @. = @.6 = 'daleth [dalet]' /*assign a default value to all of ; @.18= */"ayin"

@.1 = '---letters of the Hebrew alphabet---' ; @.137 = 'kaphhe' [kaf]' ; @.19= "pe"

@.3 9 = 'alephzayin' [alef]' ; @.15 21= 'mem'"qoph [qof]"

@.4 @.10= 'bethheth [bethet]' ; @.16 22= 'nun'"resh"

@.5 = 'gimel' @.11= 'teth [tet]' ; @.17 23= 'samekh'"shin"

@.6 @.12= 'dalethyod' [dalet]' ; @.18 24= 'ayin'"taw [tav]"

@.7 = 'he' do #=1 while @.#\==''; end; #=#-1 /*determine #elements in list; adjust @.19 = 'pe'#*/

show: w=length(#); do j=1 for #; say 'element' right(j,w) arg(1)":" @.j; end; return</lang>