Valentin Albillo's "Boldly Going... Going Back to the roots" now for the HP-41 !

[Vincent Weber]

I managed to speed up the '41 program with some optimizations, mainly having the complex stack routines stored in HEPAX and all XEQs to them converted into XROMs. Now, in the above example where R=PI, instead of over 3 minutes, the program runs in 1min 40 seconds!

I made a 15C version. While the 15C is a ground-breaking machine with MCODE complex stack routines, it does not do much better: 1min 20 seconds. Maybe because its processor is slower than the 41's by half.

In addition, the 15C program is not really simpler nor shorter than the '41 one, because the 15C lacks complex registers, so you have to write 4 steps for each store and recall operation. Furthermore Valentin's original program for the 35S makes heavy use of complex recall arithmetics, not possible on the 15C precisely because of this lack of complex registers. The only real advantage of the 15C is that you have a 4-level stack instead of 2, so intermediate computation storage is not necessary (but this happens only once in the '41 version).

So,' 41 and 15C almost on par on this one!