(HP15C / HP41 ) Recursive program of the 1st April

[Nihotte(lma)]

Do you know The Shadoks ?
(from Jacques Rouxel and Claude Piéplu on French TV between years 1968 and 1973)

The Shadoks were known for mottos such as:
« Why do it the easy way when you can do it the hard way ? »
(« Pourquoi faire simple quand on peut faire compliqué ? »)

Now, I know why : to make it running on the HP12C, of course !!

So, the program version for the HP12C is coming in the dance too.

And as usual, with other of my works already published in this forum for this calculator, no use of index register or indirect memories in this program.
However, one register acts as the stack and another as the level pointer.

Some compromises have been necessary.
For example, no use of CLEAR REG is possible in a program on the HP12C; so this action is needed before to run the expected search.
In other way, the constant memory of the calculator does'nt save the program pointer.
If a long program falls in auto power off after displaying a result, you must resume with a manual GTO 35 and R/S.
(However, in the majority of cases, the first responses are coming relatively quickly with this version of the program - try 45 ENTER 9 !).

Remark :
After a first full process, at the global end of the search, the work registers are empty again.
Like after a f CLEAR REG.
But PMT always retains 10 !
In this case, no needs to CLEAR all the memories or to store 10 on PMT again.

The listing of the program assumes two examples of use.



13/04/2020 - 22:48 : program fall --> program falls