[問題] 時間複雜度
根據big O的定義:存在c,n0>0使得當n>=n0時,f(n)<=cg(n)
今天老師教了一題95成大資工的考題
n平方+n*lgn+n/2=O(n八次方)
True or False?
答案是True
那麼請問一下為甚麼2個for圈(for包for)的複雜度是O(n平方)而不寫成O(n八次方)?
演算法新手請教!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.173.22.221
→
10/01 01:12, , 1F
10/01 01:12, 1F
→
10/01 01:14, , 2F
10/01 01:14, 2F
→
10/01 01:15, , 3F
10/01 01:15, 3F
→
10/01 01:18, , 4F
10/01 01:18, 4F
→
10/01 01:19, , 5F
10/01 01:19, 5F
→
10/01 01:20, , 6F
10/01 01:20, 6F
→
10/01 01:21, , 7F
10/01 01:21, 7F
→
10/01 01:27, , 8F
10/01 01:27, 8F
→
10/01 01:30, , 9F
10/01 01:30, 9F
→
10/01 01:43, , 10F
10/01 01:43, 10F
→
10/01 01:43, , 11F
10/01 01:43, 11F
→
10/01 02:19, , 12F
10/01 02:19, 12F
→
10/01 02:20, , 13F
10/01 02:20, 13F
推
10/01 02:55, , 14F
10/01 02:55, 14F
推
10/01 04:21, , 15F
10/01 04:21, 15F
→
10/01 05:52, , 16F
10/01 05:52, 16F
→
10/01 05:53, , 17F
10/01 05:53, 17F
推
10/01 16:27, , 18F
10/01 16:27, 18F
→
10/01 16:27, , 19F
10/01 16:27, 19F
推
10/01 17:58, , 20F
10/01 17:58, 20F