Ask Question
1 November, 13:46

What is the Big O for Towers of Hanoi algorithm?

+1
Answers (1)
  1. 1 November, 15:50
    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 you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers