Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com

Recurrence Relation for Tower of Hanoi Problem

Easy
0/10

Problem statement

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is :

Options: One or more answers may be correct
T(n) = 2T(n − 2) + 2
T(n) = 2T(n − 1) + n
T(n) = 2T(n/2) + 1
T(n) = 2T(n − 1) + 1