汉诺塔的递归算法

#include<stdio.h>

void Hanoi(int n,char A,char B,char C)
{
    if(n<=0)
        return;
    if(n==1)
        printf("Move %d From %c To %c\n",n,A,C);  //只有一个盘子时将其从A移到C
    else
    {
        Hanoi(n-1,A,C,B);  //将上面n-1个盘子从Ａ移到Ｂ
        printf("Move %d From %c To %c\n",n,A,C);  //将n号盘子从A移到C
        Hanoi(n-1,B,A,C);  //将n-1个盘子从B移到C
    }
}

int main()
{
    printf("Input the number of dishes:");
    int num=0;
    scanf("%d",&num);
    Hanoi(num,'A','B','C');
    return 0;
}