资源预览内容
第1页 / 共50页
第2页 / 共50页
第3页 / 共50页
第4页 / 共50页
第5页 / 共50页
第6页 / 共50页
第7页 / 共50页
第8页 / 共50页
第9页 / 共50页
第10页 / 共50页
亲,该文档总共50页,到这儿已超出免费预览范围,如果喜欢就下载吧!
资源描述
/ 汉诺塔 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 “) ;scanf(“%d”,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”,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”,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 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 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) ; 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)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 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(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 ) 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 C A 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 BOutputA C A 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 C A 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 ) 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 C A 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 ) 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 C A 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 ( 3, A, B, C )3 A B CH ( 2, A, C, B )2 A C BOutputA C A 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 C A BH(n,A,B,C)H(n-1,a,c,b)H ( 1
收藏 下载该资源
网站客服QQ:2055934822
金锄头文库版权所有
经营许可证:蜀ICP备13022795号 | 川公网安备 51140202000112号