[問題] 計概問題
請問有一個程式
int sum=0;
for(int i=0 ;i < n ;i=i+2)
sum = sum +i;
請問它的時間複雜度是多少?
O(nlog2n) ? O(logn) ? 還是其他呢?
先謝謝大大的回答
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.161.139.234
→
03/21 14:21, , 1F
03/21 14:21, 1F
→
03/21 14:23, , 2F
03/21 14:23, 2F
推
03/21 14:24, , 3F
03/21 14:24, 3F
→
03/21 14:27, , 4F
03/21 14:27, 4F
→
03/21 14:31, , 5F
03/21 14:31, 5F
→
03/21 14:35, , 6F
03/21 14:35, 6F
→
03/21 14:41, , 7F
03/21 14:41, 7F
→
03/21 14:42, , 8F
03/21 14:42, 8F
→
03/21 14:46, , 9F
03/21 14:46, 9F
→
03/21 14:48, , 10F
03/21 14:48, 10F
→
03/21 14:51, , 11F
03/21 14:51, 11F
→
03/21 14:52, , 12F
03/21 14:52, 12F
推
03/21 23:04, , 13F
03/21 23:04, 13F
→
03/21 23:05, , 14F
03/21 23:05, 14F
討論串 (同標題文章)