Re: [理工] [資結]-時間複雜度
(a)2n = O(n)
(b)nlog 8+log n = O(n)+O(lgn) = O(n)
(c)16^ n-10 = O(16^n)
(d)64 = O(1)
(e) (log n)^2 = O(lgn*lgn)
(f)n^3
(g) 4^log n = n^lg4 = n^2
(h) n!log n = O(n!logn)
(i)2^n-3 =O(2^n)
(j)n^5
由小到大: d < e < a = b < g < f < j < i < c < h
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 60.244.37.16
→
03/10 19:54, , 1F
03/10 19:54, 1F
推
03/10 19:55, , 2F
03/10 19:55, 2F
→
03/10 19:58, , 3F
03/10 19:58, 3F
※ 編輯: crazykk 來自: 60.244.37.16 (03/10 19:58)
推
03/10 20:21, , 4F
03/10 20:21, 4F
討論串 (同標題文章)