Anonymous user
Towers of Hanoi: Difference between revisions
Simpler first D version
(adding gap) |
(Simpler first D version) |
||
Line 206:
=={{header|D}}==
===Recursive===
<lang d>
void hanoi(int n, char from, char to, char via) {
hanoi(n - 1, from, via, to);
▲ return (n > 0) ?
}
▲ }
▲ writefln("Move disk %s from %s to %s", n, src, dst) ;
}
void main() {
}</lang>
Output:
<pre>Move disk 1 from L to M
Move disk 2 from L to R
Move disk 1 from M to R
Move disk 3 from L to M
Move disk 1 from R to L
Move disk 2 from R to M
Move disk 1 from L to M</pre>
===Iterative===
ref : [http://hanoitower.mkolar.org/shortestTHalgo.html The shortest and "mysterious" TH algorithm]
|