Ask Question

What is the Big O for Towers of Hanoi algorithm?

+4
Answers (1)
  1. 8 May, 16:47
    0
    6down vote favorite

    3

    Is there a solution for Towers of Hanoi whose running time is less than O (2n) where n is the number of disks to move? My solution takes O (2n) time.

    Also, the below solution is with recursion. Can we use Dynamic Programming with the concept of memorization to solve this in a lesser time?
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “What is the Big O for Towers of Hanoi algorithm? ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers