?? hanoi塔問題,用遞歸算法.c.txt
字號:
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');
}
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -