Towers of Hanoi 2
Solution2: The divide and conquer technique.
The problem of moving the n smallest disks from A to B can be thought of as consisting of 2 sub problems of size n-1
First move the n-1 smallest disks from A to C exposing the nth smallest disk on peg A.
Move that disk from A to B
Then move the n-1 smallest disks from C to B
The movement of the n-1 smallest disks is accomplished by a recursive application of the procedure