Taxicab numbers: Difference between revisions

Line 1,888:

@.=.; #=0; @@.=0; @and=" ──and── "; $.= /*set some REXX vars and handy literals*/

/* [↓] generate extra taxicab numbers.*/

do j=1 until #>=mx; C=j**3 /*taxicab numbers may not be in order. */

!.j=C /*use memoization for cube calculation.*/

do k=1 for j-1; s=C+!.k /*define a whole bunch of cube sums. */

if @.s==. then do /*Cube not defined? Then process it. */

@.s=j; b.s=k /*define @.S and B.S≡sum of 2 cubes*/

Line 1,904:

end /*j*/ /* [↑] complete with overage numbers. */

call ~~Bsort~~ # /*use a bubble sort on taxicab numbers.*/

call bSort # /*use a bubble sort on taxicab numbers.*/

do range=1 to 3; call tell L.range, H.range; say; end /*range*/

do range=1 for 3; call tell L.range, H.range; say; end /*range*/

exit /*stick a fork in it, we're all done. */

/*──────────────────────────────────────────────────────────────────────────────────────*/

r: return right(arg(1),w)'^3'arg(2) /*right─justify a number, append "^3" */

r: return right(arg(1), w)'^3'arg(2) /*right─justify a number, append "^3" */

tell: do t=arg(1) to arg(2); _=#.t; say right(t,9)':' $._; end; return

tell: do t=arg(1) to arg(2); _=#.t; say right(t, 9)':' $._; end; return

/*──────────────────────────────────────────────────────────────────────────────────────*/

~~Bsort~~: procedure expose @.; parse arg #; m=#-1 /*bubble sort (in ascending order). */

bSort: procedure expose @.; parse arg #; m=#-1 /*a bubble sort (in ascending order). */

do m=m for m by -1 until ok; ok=1;

do m=m for m by -1 until ok; ok=1

do j=1 for m; k=j+1; if @.j <= @.k then iterate

do j=1 for m; k=j+1; if @.j<=@.k then iterate

_=@.j; @.j=@.k; @.k=_; ok=0 /*swap ~~two~~ elements.*/

_=@.j; @.j=@.k; @.k=_; ok=0 /*swap 2 elements.*/

end /*j*/

end /*m*/