Anonymous user
Towers of Hanoi: Difference between revisions
Added Java section
m (Recursion moved to Towers of Hanoi: Towers of Hanoi is an excellent application of Recursion, but it does not necessarily exemplify it.) |
(Added Java section) |
||
Line 17:
return moves
end hanoi
==[[Java]]==
[[Category:Java]]
public void move(int n, int from, int to, int via) {
if (n == 1) {
System.out.println("Move disk from pole " + from + " to pole " + to);
} else {
move(n - 1, from, via, to);
move(1, from, to, via);
move(n - 1, via, to, from);
}
}
==[[Python]]==
| |||