recurrence relation

hanoi(int n, char from, char tmp, char to)

 

hanoi(n-1, from, to, tmp);

prinf("%c->%c", from, tmp);

hanoi(n-1, tmp, from, to);

 

-> h(n) = 2h(n-1) + 1

 

 

---

fibonacci(int n) 

 

-> f(n) = f(n-1) + f(n-2)