#include <stdio.h>
int hanoi(int n,char a,char b,char c){
if(n > 0){
if( n == 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,‘a‘, ‘b‘, ‘c‘);
getchar();
return 0;
}
本文出自 “Linux运维” 博客，请务必保留此出处http://2853725.blog.51cto.com/2843725/1390964
递归系列------------汉诺塔递归解法,布布扣,bubuko.com
原文：http://2853725.blog.51cto.com/2843725/1390964