Jump to content

Talk:Hofstadter Figure-Figure sequences: Difference between revisions

Talk:Hofstadter Figure-Figure sequences (view source)

Revision as of 20:49, 21 May 2015

820 bytes removed ,  9 years ago
m
→‎timings for the REXX solutions: replaced the REXX program, updated the timings.
m (→‎timings for the REXX solutions: removed STYLE from the PRE html tag.)
m (→‎timings for the REXX solutions: replaced the REXX program, updated the timings.)
Line 34:
 
I normally don't including timings for the REXX solutions that I post, but when I saw the 2<sup>nd</sup> REXX example's timings,
 
<br>I decided to go back and include the timings here as the 2<sup>nd</sup> example's timings seemed a bit high.
<br><br>I didn't expect a difference of magnitude.▼
 
<lang rexx>/*REXX pgm to calculate & verify the Hofstadter Figure-Figure sequences.*/▼
▲<br><br>I didn't expect a difference of magnitude.
▲<lang rexx>/*REXX pgm to calculatecalculates & verifyverifies the Hofstadter Figure-Figure sequences.*/
call time 'Reset'
parse arg x highVhigh bot . /*obtain any C.L. specifications.*/
if x=='' then x=10; if highVhigh=='' then highVhigh=1000 /*use the defaults?*/
lowif bot=1 ='' then bot=40 /*use unity" " " as the starting point*/
low=1; if x<0 then low=abs(x) /*only show a single │X│ value.*/
r.=0; r.1=1; rr.=r.; rr.1=1 /*initialize the R and& RR arrays.*/
s.=0; s.1=2; ss.=s.; ss.2=1 /* " " S /* " SS " S array. */
errs=0; $.=0
do i=low to abs(x) /*show first X values of R & S */
say right('R('i") =",20) right(ffr(i),7), /*show nice*/
right('S('i") =",20) right(ffs(i),7) /* R & S */
end /*i*/
if x<1 then exit /*stickif a forkx in≤ it0, then we're all done.*/▼
 
do m=1 for 40bot; r=ffr(m); $.r=1; end /*calculate 1st 40 R values.*/▼
 
@='duplicate number in R and S lists:' /* [↓] calc. 1st 960 S values.*/
do n=1 for high-bot; s=ffs(n); if $.s then call sErr @ s; $.s=1; end
 
/* [↓] verify presenceall and1≤#≤1k uniqueness.present*/▼
do v=1 for high; if \both$.v then call sayErrsErr 'missing R │ S:' v; end▼
say 'took' format(time('Elapsed'),,2) "seconds."
▲if x<1 then exit /*stick a fork in it, we're done.*/
/*═══════════════════════════════════════verify 1st 1k: unique & present*/
both.=0 /*initialize the BOTH array. */
/*build list of 1st 40 R values.*/
▲ do m=1 for 40; r=ffr(m) /*calculate 1st 40 R values.*/
both.r=1 /*build the BOTH array. */
end /*m*/
/*build list of 1st 960 S values.*/
do n=1 for 960; s=ffs(n) /*calculate 1st 960 S values.*/
if both.s then call sayErr 'duplicate number in R and S lists:' s
both.s=1 /*add to the BOTH array. */
end /*n*/
▲ /*verify presence and uniqueness.*/
do v=1 for highV /*verify all 1 ≤ # ≤ 1k present.*/
▲ if \both.v then call sayErr 'missing R │ S:' v
end /*v*/
say
@vif errs==0 then say 'verification completed for all numbers from 1 ──►'; @i=high " [inclusive]." /*shortcuts to shorten prog width*/
else say @v 'verification failed with' errs "errors."▼
if errs==0 then say @v 'completed for all numbers from 1 ──►' highV @i
▲ else say @v 'failed with' errs "errors."
say 'took' format(time('E'),,2) "seconds."
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────FFR subroutine──────────────────────*/
ffr: procedure expose r. s. rr. ss.; parse arg n
if r.n\==0 then return r.n /*Defined? Then return the value.*/
_=ffr(n-1) + ffs(n-1) /*calculate the FFR value. */
r.n=_; rr._=1; return _ /*assign the value to R & andRR; RRreturn.*/
return _ /*return the value to the invoker*/
/*──────────────────────────────────FFS subroutine──────────────────────*/
ffs: procedure expose r. s. rr. ss.; parse arg n /*search for ¬null R│S #.*/
if s.n==0 then do k=1 for n do k=1 for n while s.n==0 /*search for[↓] not null1st IF Ris │a Sshort num.circuit*/
if s.k\==0 then if ffr(k)\==0 then iterate /*short circuit*/
km=k-1; _=s.km+1 /*the next SS number, possibly.*/
_=_+rr._; s.k=_ /*maybedefine adjustan forelement theof FRRS numarray.*/
s.k=_; ss._=1 end /*define couple of FFS numbers.k*/
return s.n end /*kreturn the value to the invoker*/
/*──────────────────────────────────SERR subroutine─────────────────────*/
return s.n /*return the value to the invoker*/
sayErrsErr: errs=errs+1; say; say '***error***!'; say; say arg(1); say; return</lang>▼
/*──────────────────────────────────SAYERR subroutine───────────────────*/
▲sayErr: errs=errs+1; say; say '***error***!'; say; say arg(1); say; return</lang>
'''output''' when using the defaults:
<pre>
Line 104 ⟶ 95:
 
verification completed for all numbers from 1 ──► 1000 [inclusive].
took 1.5852 seconds.
</pre>
The (above) example was run under Windows 7 on a HP box (3.2GHz) using Regina.
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/203388"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information