[資工] 幾題基本的資料結構
1.
void perm (char *list, int i, int n){
/*產生list[i]到list[n]的所有排列*/
int j , temp;
if (i == n){
for (j = 0;j <= n;j++){
printf("%c",list[j]);
printf(" ");
}
}
else{/*list[i]到list[n]之間形成超過一種以上的排列時，遞迴產生他們*/
for (j = 1 ; j <= n ; j++){
SWAP(list[i],list[j],temp);
perm(list,i+1,n);
SWAP(list[i],list[j],temp);
}
}
}
-----------------------------------------------------------------------------
2.
費氏數列的Iterative algorithm or program
-----------------------------------------------------------------------------
3.
For i=1 to n do
For j=1 to i do
x=x+1
end
end
請問x=x+1這個指令執行幾次，怎麼去思考?
-----------------------------------------------------------------------------
4.
For i=1 to n do
For j=1 to i do
For k=1 to j do
x=x+1
end
end
end
x=x+1執行次數?
不好意思
小弟現在開始拼明年研所考
還請各位高人指點
如果可以還請站內信MSN
一起當書友~
感謝...
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.170.34.7
→
03/01 21:30, , 1F
03/01 21:30, 1F
→
03/01 21:31, , 2F
03/01 21:31, 2F
→
03/01 21:32, , 3F
03/01 21:32, 3F
推
03/01 21:36, , 4F
03/01 21:36, 4F
→
03/01 21:38, , 5F
03/01 21:38, 5F
→
03/01 22:00, , 6F
03/01 22:00, 6F
→
03/01 22:02, , 7F
03/01 22:02, 7F
→
03/01 22:02, , 8F
03/01 22:02, 8F
→
03/01 22:10, , 9F
03/01 22:10, 9F
推
03/01 22:13, , 10F
03/01 22:13, 10F
推
03/01 23:02, , 11F
03/01 23:02, 11F
推
03/01 23:07, , 12F
03/01 23:07, 12F
→
09/11 14:19, , 13F
09/11 14:19, 13F
討論串 (同標題文章)