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

Just another update

Browse source
This commit is contained in:
Ingy döt Net 2015-02-20 00:35:01 -05:00
parent a25938f123
commit 00a190b0a6
6591 changed files with 94363 additions and 23227 deletions
Download patch file Download diff file Expand all files Collapse all files

40
Task/Fibonacci-sequence/REXX/fibonacci-sequence.rexx
View file

@ -1,23 +1,23 @@
/*REXX program calculates the Nth Fibonacci number, N can be zero or neg*/
numeric digits 210000 /*prepare for some big 'uns. */
parse arg x y . /*allow a single number or range.*/
if x=='' then do; x=-40; y=abs(x); end /*No input? Use range -40 ──► +40*/
if y=='' then y=x /*if only one number, show fib(n)*/
w=max(length(x),length(y)) /*used for making output pretty. */
fw=10 /*minmum maximum width. Ka-razy*/
do j=x to y; q=fib(j) /*process each Fibonacci request.*/
fw=max(fw,length(q)) /*fib# length or the max so far. */
numeric digits 210000 /*be able to handle some big 'uns*/
parse arg x y . /*allow a single number or range.*/
if x=='' then do; x=-40; y=+40; end /*No input? Use range -40 ──► +40*/
if y=='' then y=x /*if only one number, show fib(n)*/
w=max(length(x), length(y)) /*used for making output pretty. */
fw=10 /*minmum maximum width. Ka-razy.*/
do j=x to y; q=fib(j) /*process each Fibonacci request.*/
L=length(q) /*obtain the length (width) of Q.*/
fw=max(fw, L) /*fib# length or the max so far. */
say 'Fibonacci('right(j,w)") = " right(q,fw) /*right justify Q.*/
if length(q)>10 then say 'Fibonacci('right(j,w)") has a length of" l
end /*j*/
if L>10 then say 'Fibonacci('right(j,w)") has a length of" L
end /*j*/ /* [↑] list a Fib seq. of x──►y */
exit /*stick a fork in it, we're done.*/
/*─────────────────────────────────────FIB subroutine (non-recursive)───*/
fib: procedure; parse arg n; na=abs(n); a=0; b=1
if na<2 then return na /*handle couple of special cases.*/
do k=2 to na; s=a+b /*sum the numbers up to │n│ */
parse value b s with a b /*faster version of: a=b; s=b */
end /*k*/
if n>0 | na//2==1 then return s /*if positive or odd negative ...*/
return -s /* return a negative Fib number.*/
/*──────────────────────────────────FIB subroutine──────────────────────*/
fib: procedure; parse arg n; a=0; b=1; na=abs(n) /*use |n| */
if na<2 then return na /*handle 3 special cases (-1,0,1)*/
/* [↓] method is non-recursive.*/
do k=2 to na; s=a+b; a=b; b=s /*sum the numbers up to │n│ */
end /*k*/ /* [↑] (only positive Fibs used)*/
/* [↓] na//2 [same as] na/2==1 */
if n>0 | na//2 then return s /*if positive or odd negative ···*/
return -s /*return a negative Fib number. */