Non-recursion based (Tower of Hanoi Tower of Hanoi)
Jump to navigation
Jump to search
Time Complexity
$O({2}^n)$
Space Complexity
$O(n)$ bits
(Only need to keep track of current configuration)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940
Reference
NA