递归算法：汉诺塔问题

#include<iostream>
using namespace std;

void moveDisk(int n, char from, char to, char tmp);

int main(){
    moveDisk(6, ‘A‘, ‘C‘, ‘B‘);
    int a;
    cin >> a;
    return 1;
}

//123456

void moveDisk(int n, char from, char to, char tmp){
    if (n == 1){
        cout << "move disk"<<n<<" from " << from <<" to "<<to<< endl;
    }
    else{
        moveDisk(n - 1, from, tmp, to);
        cout << "move disk" << n << " from " << from << " to " << to << endl;
        moveDisk(n - 1, tmp, to, from);
    }
}