11-Recursion in Scheme
Recursion is an odd concept. It is where a function calls itself. Obviously, this creates a loop (the only kind of loop there is in functional programming). For this to work, there has to be a way out - the base case. We therefore create a function (which here is called rec-step) which contains the command to be repeated. After testing that that works we create another function which calls itself, rec-step and has at least one basecase (a way out). Once that has been tested and shown to work we can replace the call to rec-step with a lambda function so that all the code is in one place.
The code used in this video can be found via https://lyw4.life/Resources/scheme.php.
On this page of the site you can watch the video online 11-Recursion in Scheme with a duration of hours minute second in good quality, which was uploaded by the user Dr. Andy Wicks 21 February 2021, share the link with friends and acquaintances, this video has already been watched 1,993 times on youtube and it was liked by 25 viewers. Enjoy your viewing!
