GATE | GATE CS 2012 | Question 16

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


Answer: (D)

Explanation: See question 1 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-29/

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.