How does recursion work in the Tower of Hanoi problem?

Can you explain how recursion works in the Tower of Hanoi problem?

Sure! The Tower of Hanoi is a classic problem that involves moving disks between three pegs. Recursion helps solve it by breaking it down into smaller subproblems.

What are the base cases for the recursion in this problem?

The base case occurs when there is only one disk to move. In that case, you simply move the disk from the source peg to the destination peg.

And how do you handle more than one disk?

For more than one disk, you first move the top n-1 disks to an auxiliary peg, then move the nth disk to the destination peg, and finally move the n-1 disks from the auxiliary peg to the destination peg.

Can you provide a code example in C++?

Absolutely! Here's a simple C++ implementation:

void towerOfHanoi(int n, char source, char destination, char auxiliary) {
    if (n == 1) {
        cout << "Move disk 1 from " << source << " to " << destination << endl;
        return;
    }
    towerOfHanoi(n - 1, source, auxiliary, destination);
    cout << "Move disk " << n << " from " << source << " to " << destination << endl;
    towerOfHanoi(n - 1, auxiliary, destination, source);
}