Iteration based (Tower of Hanoi Tower of Hanoi)

From Algorithm Wiki
Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(n)$ auxiliary bits (Only need to keep track of current configuration) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1883 == Reference == NA")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^n)$

Space Complexity

$O(n)$ auxiliary bits

(Only need to keep track of current configuration)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1883

Reference

NA

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