递归汉诺塔（代码、分析、汇编）

代码&＃xff1a;

#include void hanoi(int n, char a, char b, char c)
{if( n > 0 ){if( n &＃61;&＃61; 1 ){printf("%c -> %c\n", a, c);}else{hanoi(n-1, a, c, b);printf("%c -> %c\n", a, c);hanoi(n-1, b, a, c);}}
}int main()
{hanoi(8, &＃39;a&＃39;, &＃39;b&＃39;, &＃39;c&＃39;);return 0;
}

分析&＃xff1a;

汇编&＃xff1a;