数据结构学习之递归求解汉诺塔问题

#include <fstream>
#include <iostream>
using namespace std;

//盘子的数目
#define numOfDisks 3

//在文本文件out.txt中输出结果
ofstream fout("out.txt");

void Move(int n,char x,char y)
{
	fout<<"move "<<n<<" from "<<x<<" to "<<y<<endl;
}
void show(int n,char x,char y){

	cout<<"move "<<n<<" from "<<x<<" to "<<y<<endl;
}

//递归求解
void Hannoi(int n,char a,char b,char c)
{
	if(n==1)
	{

			Move(1,a,c);
			show(1,a,c);
	}
	else
	{
		Hannoi(n-1,a,c,b);
		Move(n,a,c);
		show(n,a,c);
		Hannoi(n-1,b,a,c);
	}
}

int main()
{
	fout<<"The solution for Hanoi, when the number of disks is "<<
		numOfDisks<<endl;
	Hannoi(numOfDisks,'a','b','c');
	fout.close();
//	cout<<"The End! Please Check out.txt."<<endl;
	return 0;
}