in the sixth lecture : recursion about 24:40, the professor was trying an example with a tower of hanoi so he wrote:
Code:
def hanoi(n,f,t,s):
if n == 1:
print 'move from ' +f +' to ' +t
else:
hanoi(n-1,f,s,t)
hanoi(1,f,t,s)
hanoi(n - 1,s,t,f)
which i didn't understand it because according to my understanding it if n equal 1 it will print : print 'move from ' +f +' = ' +t, and then exit the functionand if n doesn't equal 1 it will keep calling the fist call in the else dent : hanoi(n-1,f,s,t) only and not printing anything until n became

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Looking for something else?

Not the answer you are looking for? Search for more explanations.