算法之美：汉诺塔（Hanoi）问题

#include <stdio.h>

void hano(int n, int src, int aux ,int dest)/*n为移动盘子数，src为起始杆，dest为目标杆，aux为辅助杆*/
{
    if(n == 1)
    {
        printf("mov no.%d disc :from %c to %c\n",n,src,dest);

        return;
    }

    hano((n - 1),src,dest,aux);
    printf("mov no.%d disc: from %c to %c\n",(n - 1),src,dest);
    hano((n - 1),aux,src,dest);
}

int main()
{
    hano(3,'A','B','C');

    return 0;
}