汉诺塔问题的详解.ppt

上传人：可****

文档编号：84688836

上传时间：2023-04-06

格式：PPT

页数：50

大小：500KB

( 4.5 )

《汉诺塔问题的详解.ppt》由会员分享，可在线阅读，更多相关《汉诺塔问题的详解.ppt（50页珍藏版）》请在淘文阁 - 分享文档赚钱的网站上搜索。

1、/汉诺塔汉诺塔 ABCABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔 ABC/汉诺塔汉诺塔/汉诺塔汉诺塔#include void hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn”,a,c);hanoi(n-1,b,a,c);void main()int n;printf(Input the number of diskes:n

2、“);scanf(“%d”,&n);hanoi(n,A,B,C);Stackn a b cn a b cOutput/汉诺塔汉诺塔 void main()int n;printf(Input the number of diskes:n“);scanf(“%d”,&n);hanoi(n,A,B,C);Stackn a b cn a b cH(3,A,B,C)3 A B COutputH(n,A,B,C)/汉诺塔汉诺塔 void main()int n;printf(Input the number of diskes:n“);scanf(“%d”,&n);hanoi(n,A,B,C);Stac

3、kn a b cn a b cH(3,A,B,C)3 A B COutputH(n,A,B,C)void hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);/汉诺塔汉诺塔Stackn a b cn a b cH(3,A,B,C)3 A B C2 A C B1 A B COutputH(n,A,B,C)H(n-1,a,c,b)H(n-1,a,c,b)H(0,A,C,B)H(n-1,a,c,b)0 A C BH(2,A,C,B)H(1,A,B,C)void

4、hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BH(1,A,B,C)1 A B COutputH(n,A,B,C)H(n-1,a,c,b)H(n-1,a,c,b)H(0,A,C,B)H(n-1,a,c,b)0 A C Bvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);pr

5、intf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BH(1,A,B,C)1 A B COutputA CH(n,A,B,C)H(n-1,a,c,b)H(n-1,a,c,b)coutvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)

6、2 A C BH(1,A,B,C)1 A B COutputA CH(n,A,B,C)H(n-1,a,c,b)H(n-1,a,c,b)H(0,B,A,C)H(n-1,b,a,c)0 B A Cvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BH(1,A,B,C)1 A B COutputA CH(n,A,B,C)H(n-1,a,c,b)H(

7、n-1,a,c,b)H(0,B,A,C)H(n-1,b,a,c)0 B A Cvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BH(1,A,B,C)1 A B COutputA CH(n,A,B,C)H(n-1,a,c,b)H(n-1,a,c,b)void hanoi(int n,char a,char b,char c)if (n=1)h

8、anoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BOutputA CA BH(n,A,B,C)H(n-1,a,c,b)coutvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BO

9、utputA CA BH(n,A,B,C)H(n-1,a,c,b)1 C A BH(n-1,b,a,c)H(1,C,A,B)void hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BOutputA CA BH(n,A,B,C)H(n-1,a,c,b)H(1,C,A,B)1 C A BH(n-1,b,a,c)H(0,C,B,A)H(n-1,a,c,b

10、)0 C B Avoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BOutputA CA BH(n,A,B,C)H(n-1,a,c,b)H(1,C,A,B)1 C A BH(n-1,b,a,c)H(0,C,B,A)H(n-1,a,c,b)0 C B Avoid hanoi(int n,char a,char b,char c)if (n=1)

11、hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BOutputA CA BH(n,A,B,C)H(n-1,a,c,b)H(1,C,A,B)1 C A BH(n-1,b,a,c)C Bcoutvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(

12、3,A,B,C)3 A B CH(2,A,C,B)2 A C BOutputA CA BH(n,A,B,C)H(n-1,a,c,b)H(1,C,A,B)1 C A BH(n-1,b,a,c)C BH(0,A,C,B)H(n-1,b,a,c)0 A C Bvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BOutputA CA BH(n,A,B

13、,C)H(n-1,a,c,b)H(1,C,A,B)1 C A BH(n-1,b,a,c)C BH(0,A,C,B)H(n-1,b,a,c)0 A C Bvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BOutputA CA BH(n,A,B,C)H(n-1,a,c,b)H(1,C,A,B)1 C A BH(n-1,b,a,c)C Bvoid

14、 hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BOutputA CA BH(n,A,B,C)H(n-1,a,c,b)C Bvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b c

15、n a b cH(3,A,B,C)3 A B CH(2,A,C,B)2 A C BOutputA CA BH(n,A,B,C)H(n-1,a,c,b)C BA Ccoutvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(n-1,b,a,c)A Cvoid hanoi(int n,char

16、 a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A C1 B C AH(n-1,b,a,c)H(n-1,a,c,b)A CH(0,B,A,C)H(n-1,a,c,b)0 B A CH(1,B,C,A)void hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf

17、(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(1,B,C,A)1 B C AH(n-1,b,a,c)H(n-1,a,c,b)A CH(0,B,A,C)H(n-1,a,c,b)0 B A Cvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a

18、b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(1,B,C,A)1 B C AH(n-1,b,a,c)H(n-1,a,c,b)A CB Acoutvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(1,B,C,

19、A)1 B C AH(n-1,b,a,c)H(n-1,a,c,b)A CB AH(0,C,B,A)H(n-1,b,a,c)0 C B Avoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(1,B,C,A)1 B C AH(n-1,b,a,c)H(n-1,a,c,b)A CB AH(0,C,

20、B,A)H(n-1,b,a,c)0 C B Avoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(1,B,C,A)1 B C AH(n-1,b,a,c)H(n-1,a,c,b)A CB Avoid hanoi(int n,char a,char b,char c)if (n=1)hanoi

21、(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(1,B,C,A)1 B C AH(n-1,b,a,c)H(n-1,a,c,b)A CB AB Ccoutvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b

22、 cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(n-1,b,a,c)A CB A1 A B CH(n-1,b,a,c)B CH(1,A,B,C)void hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(n-1,b,a,

23、c)A CB AH(1,A,B,C)1 A B CH(n-1,b,a,c)B CH(0,A,C,B)H(n-1,a,c,b)0 A C Bvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(n-1,b,a,c)A CB AH(1,A,B,C)1 A B CH(n-1,b,a,c)B CH(

24、0,A,C,B)H(n-1,a,c,b)0 A C Bvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(n-1,b,a,c)A CB AH(1,A,B,C)1 A B CH(n-1,b,a,c)B CA Ccoutvoid hanoi(int n,char a,char b,char c

25、)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);/汉诺塔汉诺塔void hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);couta c=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(n-1,b,a,c)A CB A1 A B

26、 CB CA CH(1,A,B,C)H(n-1,b,a,c)void hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(n,A,B,C)C BH(2,B,A,C)2 B A CH(n-1,b,a,c)A CB AB CA Cvoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);prin

27、tf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);Stackn a b cn a b cH(3,A,B,C)3 A B COutputA CA BH(3,A,B,C)C BA CB AB CA COvervoid hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);OverStackn a b cn a b cOutputA CA BC BA CB AB CA C/汉诺塔汉诺塔void hanoi(int n,char a,char b,char c)if (n=1)hanoi(n-1,a,c,b);printf(“%c-%cn“,a,c);hanoi(n-1,b,a,c);

文档加载中……请稍候！
如果长时间未打开，您也可以点击刷新试试。

下载文档到电脑，查找使用更方便

9 金币

版权申诉 word格式文档无特别注明外均可编辑修改；预览文档经过压缩，下载后原文更清晰！ 立即下载

配套讲稿：: 如PPT文件的首页显示word图标，表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
特殊限制：: 部分文档作品中含有的国旗、国徽等图片，仅作为作品整体效果示例展示，禁止商用。设计者仅对作品中独创性部分享有著作权。
关键词：: 汉诺塔问题详解

淘文阁 - 分享文档赚钱的网站所有资源均是用户自行上传分享，仅供网友学习交流，未经上传用户书面授权，请勿作他用。

限制150内

关于本文

本文标题：汉诺塔问题的详解.ppt
链接地址：https://www.taowenge.com/p-84688836.html