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

Another update from ingydotnet^djgoku

Browse source
This commit is contained in:
Ingy döt Net 2015-11-18 06:14:39 +00:00
parent 91df62d461
commit 948b86eafa
7604 changed files with 108452 additions and 22726 deletions
Download patch file Download diff file Expand all files Collapse all files

42
Task/Averages-Simple-moving-average/REXX/averages-simple-moving-average.rexx
View file

@ -1,24 +1,26 @@
/*REXX program illustrates simple moving average using a simple list. */
parse arg p q n . /*get some arguments (maybe). */
if p=='' then p=3 /*the 1st period (default: 3).*/
if q=='' then q=5 /* " 2nd " " 5 */
if n=='' then n=10 /*number of items in the list.*/
@.=0 /*define stemmed array, init 0*/
/*──────────────────────────────────────────build 1st half of the list. */
do j=1 for n%2; @.j=j; end /* ··· increasing values.*/
/*──────────────────────────────────────────build 2nd half of the list. */
do k=n%2 to 1 by -1; @.j=k; j=j+1; end /* ··· decreasing values.*/
/*──────────────────────────────────────────perform a simple moving avg.*/
/*REXX program illustrates simple moving average using a constructed list. */
parse arg p q n . /*get optional arguments from the C.L. */
if p=='' then p=3 /*the 1st period (the default is: 3).*/
if q=='' then q=5 /* " 2nd " " " " 5).*/
if n=='' then n=10 /*the number of items in the list. */
@.=0 /*define array with initial zero values*/
/* [↓] build 1st half of list*/
do j=1 for n%2; @.j=j; end /* ··· increasing values.*/
/* [↓] build 2nd half of list*/
do k=n%2 to 1 by -1; @.j=k; j=j+1; end /* ··· decreasing values.*/
say ' ' " SMA with " ' SMA with '
say ' number ' " period" p' ' ' period' q
say ' ──────── ' "──────────" '──────────'
do m=1 for n
say center(@.m,10) left(sma(p,m),11) left(sma(q,m),11)
end /*m*/ /* [↑] show simple moving avg.*/
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────SMA subroutine──────────────────────*/
sma: procedure expose @.; parse arg p,j; s=0; i=0
do k=max(1,j-p+1) to j+p for p while k<=j; i=i+1
s=s+@.k
end /*k*/
/* [↓] perform a simple moving average*/
do m=1 for n
say center(@.m, 10) left(sma(p,m), 11) left(sma(q,m), 11)
end /*m*/ /* [↑] show a simple moving average.*/
exit /*stick a fork in it, we're all done. */
/*────────────────────────────────────────────────────────────────────────────*/
sma: procedure expose @.; parse arg p,j; s=0; i=0
do k=max(1,j-p+1) to j+p for p while k<=j; i=i+1
s=s+@.k
end /*k*/
return s/i