Tower Of Hanoi Solving [CPP]

Tower of Hanoi is a disk transferring problem.
I hope the seeker knows the rules of transferring disks from source to destination.

Source Code

#include <iostream> using namespace std; class tower { int n; public: void read() { cout<<"Enter Number of Disks: "; cin>>n; transfer(n, 'S', 'I', 'D'); } void transfer(int n, char s, char i, char d) { if(n==0) { //cout<<"Move Disk "<<n<<" from "<<s<<" to "<<d<<"\n"; return; } else { transfer(n-1, s, d, i); cout<<"Move Disk "<<n<<" from "<<s<<" to "<<d<<"\n"; transfer(n-1, i, s, d); } } }; int main() { tower t; t.read(); }