What is the complexity of this program?? Both time and space

Question

#include <stdio.h>

// C recursive function to solve tower of hanoi puzzle
void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod)
{
if (n == 1)
{
printf("\n Move disk 1 from rod %c to rod %c", from_rod, to_rod);
return;
}
towerOfHanoi(n-1, from_rod, aux_rod, to_rod);
printf("\n Move disk %d from rod %c to rod %c", n, from_rod, to_rod);
towerOfHanoi(n-1, aux_rod, to_rod, from_rod);
}

int main()
{
int n = 2; // Number of disks
towerOfHanoi(n, 'A', 'C', 'B'); // A, B and C are names of rods
return 0;
}

Answer 1

Tq ..so much fa ur effort..and also I want to know y u related trees with this problem while finding the complexity

Answer 2

imgur.com/a/3gYlxMm :D

Answer 3

Ur answer is brilliant...I usually can think and write coding but if I want to know the complexity of any program for optimization..I got stucked. So can u pls suggest me some sources where can I learn to find the programs complexity..
And I also want to know how you got the idea of comparing it with trees.

Answer 4

I understand ....Tq so much for explaining clearly

Answer 5

Tq...