Learning Python 3 with the Linkbot/Advanced Functions Example

Some people find this section useful, and some find it confusing. If you find it confusing you can skip it. Now we will do a walk through for the following program: Basically this program creates a positive integer multiplication function (that is far slower than the built in multiplication function) and then demonstrates this function with a use of the function. This program demonstrates the use of recursion, that is a form of iteration (repetition) in which there is a function that repeatedly calls itself until an exit condition is satisfied. It uses repeated additions to give the same result as mutiplication: e.g. 3 + 3 (addition) gives the same result as 3 * 2 (multiplication).


 * Question: What is the first thing the program does?
 * Answer: The first thing done is the function mult is defined with the lines:


 * This creates a function that takes two parameters and returns a value when it is done. Later this function can be run.


 * What happens next?
 * The next line after the function,  is run.


 * And what does this do?
 * It prints  and the return value of


 * And what does  return?
 * We need to do a walkthrough of the  function to find out.


 * What happens next?
 * The variable  gets the value 3 assigned to it and the variable   gets the value 2 assigned to it.


 * And then?
 * The line  is run.  Since   has the value 2 this is false so the line   is skipped.


 * And what then?
 * The line  is run.  This line sets the local variable   to the value of  .  The value of   is 3 and the value of   is 2 so the function call is


 * So what is the value of  ?
 * We will need to run the function  with the parameters 3 and 1.


 * So what happens next?
 * The local variables in the  new run of the function are set so that  has the value 3 and   has the value 1. Since these are local values these do not affect the previous values of   and.


 * And then?
 * Since  has the value 1 the if statement is false, so the next line becomes.


 * What does this line do?
 * This line will assign the value of  to rest.


 * So what is that value?
 * We will have to run the function one more time to find that out. This time  has the value 3 and   has the value 0.


 * So what happens next?
 * The first line in the function to run is .   has the value 0 so the next line to run is


 * And what does the line  do?
 * This line returns the value 0 out of the function.


 * So?
 * So now we know that  has the value 0.  Now we know what the line   did since we have run the function   with the parameters 3 and 0.  We have finished running   and are now back to running  . The variable   gets assigned the value 0.


 * What line is run next?
 * The line  is run next. In this run of the function,   and   so now.


 * What happens next?
 * The line  is run.  This returns 3 from the function. This also exits from the run of the function  .  After   is called, we go back to running.


 * Where were we in ?
 * We had the variables  and   and were examining the line.


 * So what happens now?
 * The variable  get 3 assigned to it.  The next line   sets   to   or 6.


 * So now what happens?
 * The next line runs, this returns 6 from the function. We are now back to running the line   which can now print out the 6.


 * What is happening overall?
 * Basically we used two facts to calculate the multiple of the two numbers. The first is that any number times 0 is 0 .  The second is that a number times another number is equal to the first number plus the first number times one less than the second number .  So what happens is   is first converted into  .  Then   is converted into  .  Then we know that any number times 0 is 0 so   is 0.  Then we can calculate that   is   which is  .  Now we know what   is so we can calculate that   is   which is.

This is how the whole thing works:

3 * 2 3 + 3 * 1 3 + 3 + 3 * 0 3 + 3 + 0 3 + 3 6

Recursion
Programming constructs solving a problem by solving a smaller version of the same problem are called recursive. In the examples in this chapter, recursion is realized by defining a function calling itself. This facilitates implementing solutions to programming tasks as it may be sufficient to consider the next step of a problem instead of the whole problem at once. It is also useful as it allows to express some mathematical concepts with straightforward, easy to read code.

Any problem that can be solved with recursion could be re-implemented with loops. Using the latter usually results in better performance. However equivalent implementations using loops are usually harder to get done correctly.

Probably the most intuitive definition of recursion is:
 * Recursion
 * If you still don't get it, see recursion.

Try walking through the factorial example if the multiplication example did not make sense.

Examples
factorial.py

Output: 2! = 2 3! = 6 4! = 24 5! = 120

countdown.py

Output: 5 4 3 2 1 0