Computer Science, asked by priti732, 1 year ago

Write the recurrence relation of tower of hanoi problem and explain the formulation.

Answers

Answered by Anonymous
0

This is the first of two lectures about solving recurrences and recurrent problems. Needless to say, recurrent problems come up again and again. In particular, recurrences often arise in the analysis of recursive algorithms. In the Towers of Hanoi problem, there are three posts and seven disks of different sizes.

Similar questions