Anonymous user
Sorting Algorithms/Circle Sort: Difference between revisions
m
→{{header|REXX}}: added whitespace, used consistent spelling of variables (uppercase/lowercase).
(Added Swift solution) |
m (→{{header|REXX}}: added whitespace, used consistent spelling of variables (uppercase/lowercase).) |
||
Line 1,738:
=={{header|REXX}}==
This REXX version will work with any numbers that REXX supports, including negative and/or floating point numbers
<br>it also will work with character strings.
<lang rexx>/*REXX program uses a circle sort algorithm to sort an array (or list) of numbers. */
parse arg x /*obtain optional arguments from the CL*/
if x='' | x="," then x= 6 7 8 9 2 5 3 4 1 /*Not specified? Then use the default.*/
call make_array 'before sort:' /*display the list and make an array. */
call circleSort
call make_list ' after sort:' /*make a list and display it to console*/
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
circleSort: do
make_array: #= words(x);
make_list: y= @.1;
.swap: parse arg a,b; parse value @.a @.b with @.b @.a; swaps= swaps+1;
/*──────────────────────────────────────────────────────────────────────────────────────*/
.circleSrt: procedure expose @.; parse arg LO,HI,swaps /*obtain LO & HI arguments.*/
if LO==HI then return swaps /*1 element? Done with sort.*/
high= HI; low= LO; mid= (HI-LO) % 2
/* [↓] sort a section of #'s*/
do while LO<HI /*sort within a section. */
if @.LO>@.HI then call .swap LO,HI /*are numbers out of order ? */
LO= LO + 1;
end /*while*/ /*just process one section. */
_=
if LO==HI & @.LO>@._ then call .swap LO, _ /*numbers still out of order?*/
swaps= .circleSrt(low, low+mid, swaps)
swaps= .circleSrt(low+mid+1, high, swaps)
return swaps /*the section sorting is done*/</lang>
{{out|output|text= when using the default input:}}
| |||