Calkin-Wilf sequence: Difference between revisions

m
→‎{{header|REXX}}: fixed code that handles an even number of CF elements, expanded the number of decimal digits to handle larger integers.
m (→‎{{header|REXX}}: changed some comments.)
m (→‎{{header|REXX}}: fixed code that handles an even number of CF elements, expanded the number of decimal digits to handle larger integers.)
Line 983:
<lang rexx>/*REXX pgm finds the Nth value of the Calkin─Wilf sequence (which will be a fraction),*/
/*────────────────────── or finds which sequence number contains a specified fraction). */
numeric digits 100 /*be able to handle larger integers. */
parse arg LO HI te . /*obtain optional arguments from the CL*/
if LO=='' | LO=="," then LO= 1 /*Not specified? Then use the default.*/
Line 1,019 ⟶ 1,020:
end /*k*/
/*for inverse(c_w), K must be even*/
if k//2 then do; a.k= a.k - 1; a.k= k + 1; a.k= k + 1; end
a.0= k
do k=1 for a.0; cFrac= cFrac a.k; end /*k*/
return cFrac
/*──────────────────────────────────────────────────────────────────────────────────────*/
Line 1,030 ⟶ 1,031:
parse var rle f1 rle; obin= copies(1, f1)obin
end /*until*/
return x2d( b2x(obin) ) /*RLE2DEC: Run Length Encoding ──►--> decimal.*/</lang>
{{out|output|text=&nbsp; when using the default inputs:}}
<pre>