The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
(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
Explanation: See question 1 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-29/
Quiz of this Question
Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.