Tower of Hanoi: Recursive Algorithm
Actually, the section from where you took that code offers an explanation as well: To move n discs from peg A to peg C: move n−1 discs from A to B. This leaves disc #n alone on peg A move disc #n from A to C move n−1 discs from B to C so they … Read more