汉诺塔与递归
- 什么是汉诺塔?
点击查看描述
- 汉诺塔算法如何实现?
#include "stdio.h"
void hanoi(int n,char source,char medium,char dest){
if(n==1)
printf("%c-->%c\n",source,dest);
else{
hanoi(n-1,source,dest,medium);
hanoi(1,source,medium,dest);
hanoi(n-1,medium,source,dest);
}
}
int main(){
hanoi(3,'A','B','C');
return 0;
}
运行结果: