Sail E0 Webinar
Question
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
Options:
A .  T(n) = 2T(n − 2) + 2
B .  T(n) = 2T(n − 1) + n
C .  T(n) = 2T(n/2) + 1
D .  T(n) = 2T(n − 1) + 1
Answer: Option D


-NA-



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos

Latest Test Papers