推 PRAM:作業自己寫 02/28 20:03
→ phdch:P大 這並不是作業啦 想要自學CPP 遇到瓶頸 02/28 20:08
推 varg:去翻ds 02/28 20:25
推 suhorng:想想看迴圈會跑多少次啊orz ... 02/28 20:56
→ suhorng:應該是log2 n 吧 ? 02/28 20:56
→ MOONRAKER: < log_2 n; for i grows as 2, 4, 16, 256, ... 03/01 00:23
推 yshihyu:應該不是 log2n , log2n 是 2 4 8 16 32 ... 03/01 04:47
推 mantour:i=2^(2^k) , k = 0,1,2,... 03/01 08:25
→ mantour:應該是log_2( log_2 n) 吧 03/01 08:25