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

PROBLEM:-

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

Options

T(n) = 2T(n − 2) + 2

T(n) = 2T(n − 1) + n

T(n) = 2T(n/2) + 1

T(n) = 2T(n − 1) + 1 

ANSWER:-  D)

   

T(n) = 2T(n − 1) + 1 

• Tweet
• Share
• Share
• Share
• Share

About Admin MC3

This is dummy text. It is not meant to be read. Accordingly, it is difficult to figure out when to end it. But then, this is dummy text. It is not meant to be read. Period.

Related Post