Non-recursion based (Tower of Hanoi Tower of Hanoi)

From Algorithm Wiki

Revision as of 08:51, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Non-recursion_based_(Tower_of_Hanoi_Tower_of_Hanoi)&oldid=47542"