The recurrence relation capturing the optimal execution time of the Towers of…

PYQ GATE 2012

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

  1. A.

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

  2. B.

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

  3. C.

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

  4. D.

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

Attempted by 324 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…