Can you explain advanced recursion examples in C++?

Can you explain advanced recursion examples in C++?

Sure! Advanced recursion in C++ can include examples like the Tower of Hanoi, generating permutations, and solving the N-Queens problem. Which one would you like to explore first?

Let's start with the Tower of Hanoi.

Great choice! The Tower of Hanoi is a classic problem where you have three rods and a number of disks of different sizes. The goal is to move all the disks from the source rod to the destination rod, following these rules: only one disk can be moved at a time, and no larger disk may be placed on top of a smaller disk. Would you like to see the recursive solution in C++?

Yes, please show me the code.

Here's a simple recursive implementation in C++:

#include <iostream>
using namespace std;

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);
}

int main() {
    int n = 3; // Number of disks
    towerOfHanoi(n, 'A', 'C', 'B');
    return 0;
}

This code will move 3 disks from rod A to rod C using rod B as auxiliary.