Hanoi graph (Tower of Hanoi Tower of Hanoi)

From Algorithm Wiki
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == bits () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2008 == Reference == https://books.google.com/books/about/Topics_in_Graph_Theory.html?id=pSv3XotPCQgC")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^n)$

Space Complexity

bits

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2008

Reference

https://books.google.com/books/about/Topics_in_Graph_Theory.html?id=pSv3XotPCQgC

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