View source for Non-recursion based (Tower of Hanoi Tower of Hanoi)

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

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== 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

Return to Non-recursion based (Tower of Hanoi Tower of Hanoi).

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Non-recursion_based_(Tower_of_Hanoi_Tower_of_Hanoi)"

Navigation menu