汉诺塔算法

#include<stdio.h>

void move(char x,char y)
{
	printf("%c-->%c\n",x,y);
}

void hanoi(int m,char one,char two,char three)
{
	if(m == 1)
	{
		move(one,three);
	}
	else
	{
		hanoi(m-1,one,three,two);
		move(one,three);
		hanoi(m-1,two,one,three);
	}
}

int main()
{
	int m = 10;
	hanoi(m,'A','B','C');
	return 0;
}