[C How To Program] 习题5.39 汉诺塔
来源:互联网 发布:nba2k周琦数据 编辑:程序博客网 时间:2024/06/08 03:20
#include <stdio.h>int count = 0;void hanio( int );void move( int, int );void doh( int, int, int, int );int main(){int i;for(i = 1;i <= 10; i++){count = 0;hanio(i);printf("%d of hanio :%d times of move\n", i, count);}}/* | | | * 1 2 3 * _|_ _|_ _|_ */void hanio( int n ){doh(n , 1, 2, 3);}void doh(int n, int a, int b, int c){if(n == 1){move(a, c);return;}doh(n - 1, a, c, b);move(a, c);doh(n - 1, b, a, c);}void move( int a, int b){count ++;printf("%d -> %d\n",a, b);}
0 0
- [C How To Program] 习题5.39 汉诺塔
- [C How To Program] 习题 3.36
- [C How To Program] 习题3.38
- [C How To Program] 习题3.46
- [C How To Program] 习题5.22
- [C How To Program] 习题5.28-最大公约数
- [C How To Program] 习题4.38
- [C How To Program] 习题6.30 erato_traverse
- [C How To Program] 习题6.24c 骑士漫游问题
- [C How To Program] 习题5.32 学习算术
- [C How To Program] 习题5.37 x的n次方
- [C How To Program] 习题6.32 递归的选择排序
- [C How To Program] 习题6.38 字符串反转打印
- [C How To Program] 习题6.35 二分查找
- [C How To Program] 习题7.17 龟兔赛跑问题
- C HOW TO PROGRAM!中
- [C How To Program] 习题6.39 递归求数组的最小值
- 《java how to program》习题全解----正在创作中
- PowerDesigner15在win7-64位系统下对MySQL 进行反向工程以及建立物理模型产生SQL语句步骤图文傻瓜式详解
- Makefile 学习笔记(二) Makefile总述
- [C How To Program] 习题4.38
- tomcat8.0.15免安装版闪退
- 华为机试较难的题目
- [C How To Program] 习题5.39 汉诺塔
- Sicily1424-奖金
- win8.1编译openssl55
- [ruby] 命令行
- Star
- 正确释放Vector的内存
- 一个包含着构造函数虚析构函数类大小为多少?
- 将ip地址压缩到一个无符号整形中
- Android学习—CallBack机制