hannowi.cpp

一些常用的递归算法

#include<iostream.h>
void move_tower(int disk_num,char from,char to,char aux)
{
	if(disk_num==1)
	{
		//only one disk ,director move it from to
		cout<<"disk1"<<from<<"move"<<to<<"\n";
	}
	else
	{
		//
		move_tower(disk_num-1,from,aux,to);
        cout<<"disk"<<disk_num<<"from"<<from<<"to"<<to<<"\n";
		//
		move_tower(disk_num-1,aux,to,from);}
}
int main()
{
	//
	move_tower(4,'A','C','B');
	cout<<"task finish!"<<endl;
	return 0;
}