hanoi塔问题，用递归算法.c.txt

本课件与严蔚敏 第二版 数据结构（C版） 教材配套

www.pudn.com > algorithm > Hanoi塔问题，用递归算法.c


void towers(int n, char X, char Z, char Y) { 
char * Format1 = "\n>s>c>s>c", 
* MoveDisk1 = "move disk 1 from peg ", 
* Formatn = "\n>s>d>s>c>s>c", 
* MoveDisk = "move disk ", 
* From = " from peg ", 
* To = " to peg "; 

if (n==1){ 
printf(Format1, MoveDisk1,X, To, Z); 
printf("\n"); 
return; 
}/* 递归出口 */ 

/* 把n-1个圆盘从X借助Z移至Y */ 
towers(n-1, X, Y, Z); 

/* 把圆盘n由X直接移至Z */ 
printf(Formatn, MoveDisk, n, From, X, To, Z); 

/* 把n-1个圆盘从Y借助X移至Z */ 
towers(n-1, Y, Z, X); 
} 

main() { 
int n; 

clrscr(); 
scanf(">d",&amt;n); 
towers(n,'X', 'Z', 'Y'); 
}