c语言汉诺塔算法

#include<stdio.h>
int g_count = 0;
void Move(char x,char y)
{
g_count++;
printf("%c->%c\n",x,y);
}
void Hanoi(int n,char a,char b,char c)
{
if(n == 1)
Move(a,c);
else
{
Hanoi(n-1,a,c,b);
Move(a,c);
Hanoi(n-1,b,a,c);
}
}
int main()
{
Hanoi(7,‘A’,‘B’,‘C’);
printf("%d\n",g_count);
return 0;
}