Citer : Posté le 26/09/2024 07:47 | #

---

I don't have a ClassPad and am unfamiliar with the programming capabilities of the Classpad, except taking a quick look at the manual online. Although nothing stood out immediately, someone more familiar may know of a technique. However, any recursive routine can be rewritten to use a stack instead. I believe a List could be used as a stack (perhaps with slightly different syntax for the ClassPad): https://www.planet-casio.com/Fr/programmation/listes.php.

When you're making a function or subroutine call, that's essentially a stack operation. The call is pushing the return address onto a stack, and typically instructions are executed to push other information as well, such as local variables. Then the return pops the return address off the stack, so it knows where to go back to.

Sometimes an algorithm can be changed so that neither recursion or a stack are even necessary, which is the case for Fibonacci. However, it might be interesting to see how to modify a program to remove recursion in general, which this page explains: https://www.baeldung.com/cs/convert-recursion-to-iteration

---