My tower of Hanoi Solution | O(2^n)
292
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'

void towerofBrahma(int n, string src, string buff, string dest){
    if(n == 1){
        cout << "MOVE " + src + " " + dest << endl;
        return;
    }
    towerofBrahma(n - 1, src, dest, buff);
    cout << "MOVE " + src + " " + dest << endl;
    towerofBrahma(n - 1, buff, src, dest);
}

int main() {
    int n;
    cin >> n;
    string src = "T1", buff = "T2", dest = "T3";
    towerofBrahma(n, src, buff, dest);
    return 0;
}
Comments (0)