Challenge: Recursive Towers of Hanoi
Apply what you’ve learned about recursion in the coding exercises in this lesson.
We'll cover the following...
Problem statement
Given 3 Pegs—A, B, and C—and n Disks, all on peg A, move all disks to Peg C.
void move(int n, char sp, char ap, char ep);
📝 Note:
spwill be the first peg,A,apwill be the second peg,B, andepwill be the third peg,C...