Recursion - cont.
The Towers of Hanoi : Given 3 poles, with disks in different sizesnumbered 1..n according to size.Begin: all disks are stacked on pole Awith disk 1 on top and disk n at bottomEnd: all disks are stacked on pole C in the same order
move disk 1 from A to Cmove disk 2 from A to Bmove disk 1 from C to Bmove disk 3 from A to Cmove disk 1 from B to Amove disk 2 from B to Cmove disk 1 from A to C==> 7 moves for n = 3. (..15,31,63)- Move n-1 disks from A to B through C- Move disk n from A to C- Move n-1 disks from B to C through A