I know I'm a random contributor and biased toward the 50g (but still like the 35s, 33s, and 20s). Looking at the "recursive programming" examples in the AUR, I recalled the number of nested subroutines of the 35s, which is 20. But the 50g has this ability only limited by its memory, and can "unwind" this nesting with amazing speed.
As an illustration, this program will run through recursions of itself until the limiting number is reached (1000 here), then unwind through the "end"s in just a fraction of a second. If you make it 2000 loops, it barely becomes noticable that it is busy "ending" the loops and finishing the program.
<< 1 + DUP IF 1000 =/= THEN DUP 1 DISP RECUR END >>
Store in 'RECUR' and start with a 0 in the stack. Pretty amazing, no?
cheers, Glenn
Still in awe over HP50g
|
|
« Next Oldest | Next Newest »
|