Thursday, November 23, 2023

Optimal execution time for Tower of hanoi problem with ‘n’ disks is.......

           , , , ,       No comments:  


 

Answer: T(n) = 2T(n-1) + 1

Optimal execution time for Tower of hanoi problem with ‘n’ disks is T(n) = 2T(n-1) + 1


0 comments:

Post a Comment

Data Structures with C++



NET/SET/CS PG



Operating Systems



Computer Networks



JAVA



Design and Analysis of Algorithms



Programming in C++

Top