aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2023-09-01 09:35:06 -07:00
parent 61b93a2cd1
commit 5af6d93694
858 changed files with 20572 additions and 2082 deletions
Download patch file Download diff file Expand all files Collapse all files

88
Task/Sorting-algorithms-Strand-sort/REXX/sorting-algorithms-strand-sort.rexx
View file

@ -1,31 +1,57 @@
/*REXX program sorts a random list of words (or numbers) using the strand sort algorithm*/
parse arg size minv maxv old /*obtain optional arguments from the CL*/
if size=='' | size=="," then size=20 /*Not specified? Then use the default.*/
if minv=='' | minv=="," then minv= 0 /*Not specified? Then use the default.*/
if maxv=='' | maxv=="," then maxv=size /*Not specified? Then use the default.*/
do i=1 for size /*generate a list of random numbers. */
old=old random(0,maxv-minv)+minv /*append a random number to a list. */
end /*i*/
old=space(old) /*elide extraneous blanks from the list*/
say center('unsorted list', length(old), "─"); say old
new=strand_sort(old) /*sort the list of the random numbers. */
say; say center('sorted list' , length(new), "─"); say new
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
strand_sort: procedure; parse arg x; y=
do while words(x)\==0; w=words(x)
do j=1 for w-1 /*anything out of order?*/
if word(x,j)>word(x,j+1) then do; w=j; leave; end
end /*j*/
y=merge(y,subword(x,1,w)); x=subword(x,w+1)
end /*while*/
return y
/*──────────────────────────────────────────────────────────────────────────────────────*/
merge: procedure; parse arg a.1,a.2; p=
do forever; w1=words(a.1); w2=words(a.2) /*do while 2 lists exist*/
if w1==0 | if w2==0 then leave /*Any list empty? Stop.*/
if word(a.1,w1) <= word(a.2,1) then leave /*lists are now sorted? */
if word(a.2,w2) <= word(a.1,1) then return space(p a.2 a.1)
#=1+(word(a.1,1) >= word(a.2,1)); p=p word(a.#,1); a.#=subword(a.#,2)
end /*forever*/
return space(p a.1 a.2)
/*REXX program sorts a random list of words (or numbers) */
/* using the strand sort algorithm */
Parse Arg size minv maxv old /* obtain optional arguments from CL*/
if size=='' | size=="," then size=20 /*Not specified? use default.*/
if minv=='' | minv=="," then minv= 0 /*Not specified? use default.*/
if maxv=='' | maxv=="," then maxv=size /*Not specified? use default.*/
Do i=1 To size
old=old random(0,maxv-minv)+minv/* append random numbers to the list*/
End
old=space(old)
Say 'Unsorted list:'
Say old
new=strand_sort(old) /* sort given list (extended by random numbers) */
Say
Say 'Sorted list:'
Say new
Exit /* stick a fork in it, we're all done */
/*--------------------------------------------------------------------*/
strand_sort: Procedure
Parse Arg source
sorted=''
Do While words(source)\==0
w=words(source)
/* Find first word in source that is smaller Than its predecessor */
Do j=1 To w-1
If word(source,j)>word(source,j+1) Then
Leave
End
/* Elements source.1 trough source.j are in ascending order */
head=subword(source,1,j)
source=subword(source,j+1) /* the rest starts with a smaller */
/* value or is empty (j=w!) */
sorted=merge(sorted,head)
End
Return sorted
/*--------------------------------------------------------------------*/
merge: Procedure
Parse Arg a.1,a.2
p=''
Do Forever
w1=words(a.1)
w2=words(a.2)
Select
When w1==0 | w2==0 Then
Return space(p a.1 a.2)
When word(a.1,w1)<=word(a.2,1) Then
Return space(p a.1 a.2)
When word(a.2,w2)<=word(a.1,1) Then
Return space(p a.2 a.1)
Otherwise Do
nn=1+(word(a.1,1)>=word(a.2,1))
/* move the smaller first word of a.1 or a.2 to p */
p=p word(a.nn,1)
a.nn=subword(a.nn,2)
End
End
End