Re: [理工] [資結]-時間複雜度
※ 引述《SmallFoxChiC (小狐狸)》之銘言:
log3
n 跟 nlogn 的複雜度是誰比較大呢
→
07/21 23:12,
07/21 23:12
推
07/21 23:39,
07/21 23:39
→
07/21 23:40,
07/21 23:40
→
07/21 23:41,
07/21 23:41
→
07/22 00:21,
07/22 00:21
→
07/22 00:22,
07/22 00:22
這樣呢?
lg3 lg3-1 lg3-2
n lg3 n lg3 (lg3-1) n
lim -------- = lim ----------- = lim -------------------
n->∞ nlgn lgn + 1 1 / n
lg3-1
= lg3 (lg3-1) lim n = ∞
lg3
∴ nlgn = O (n )
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.113.93.39
推
07/22 23:33, , 1F
07/22 23:33, 1F
→
07/23 00:19, , 2F
07/23 00:19, 2F
討論串 (同標題文章)