How to determine how many times recursion function has been called...where i should add count??

Question

#include<stdio.h>
void TOH(int n,char x,char y,char z)
{    
if(n>0)
{      
TOH(n-1,x,z,y);    
  printf("\n%c to %c",x,y);
      TOH(n-1,z,y,x);  
 } }
int main() {
   int n=3;    
TOH(n,'A','B','C');
}

Answer 1

And post the code

Answer 2

How often TOH runs depends on `n`. Try to figure out a pattern, starting from the simplest case:

TOH(0) runs once, no recursion happens.

TOH(1) runs once, then recurses twice into TOH(0), which run 1 time each.
TOH(1) = 1 + 2*TOH(0) = 1 + 2*1 = 3.

TOH(2) runs once, the recurses twice into TOH(1).
TOH(2) = 1 + 2*TOH(1) = 1 + 2*3 = 7.

TOH(3) runs once, then recurses twice into TOH(2).
TOH(3) = 1 + 2*TOH(2) = 1 + 2*7 = 15.

See where this is going? Can you find a general formula?

Answer 3

Not working...take above code and edit

Answer 4

I have done that but its not working u try it with c

Answer 5

Basically, you should avoid using recursive functions. The problem with those functions are that they use all the resources on a system, and in the end, the system will crash.

Answer 6

But that tower hanoi has two recursion functions

Answer 7

Try with that

Answer 8

IRFAN SHAIKH Use Google, and you will find examples without using recursive functions.

Answer 9

IRFAN SHAIKH Use Google, and you will find examples without using recursive functions.