[理工] 複雜度計算
T(n) = T(n/2 + sqrt(n)) +n
想請教這題要怎麼求出複雜度m(_ _)m
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 140.112.25.99
※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1486715259.A.207.html
→
02/10 16:33, , 1F
02/10 16:33, 1F
感覺不太嚴謹@@,我朋友提點我「可以用夾擠,介於3n/2, n/2之間」,但是我慧根不足
無法領悟...
※ 編輯: ssssIssss (140.112.25.99), 02/10/2017 16:40:54
推
02/10 16:39, , 2F
02/10 16:39, 2F
推
02/10 16:42, , 3F
02/10 16:42, 3F
推
02/10 17:03, , 4F
02/10 17:03, 4F
是直接忽略sqrt(n)然後直接做嗎?
※ 編輯: ssssIssss (140.112.25.99), 02/10/2017 17:12:49
→
02/10 17:27, , 5F
02/10 17:27, 5F
→
02/10 17:27, , 6F
02/10 17:27, 6F
Ok! 感恩!大家明天加油!
※ 編輯: ssssIssss (140.112.25.99), 02/10/2017 17:38:39
推
02/10 17:46, , 7F
02/10 17:46, 7F
→
02/10 17:47, , 8F
02/10 17:47, 8F
→
02/10 17:50, , 9F
02/10 17:50, 9F
→
02/10 17:50, , 10F
02/10 17:50, 10F
→
02/10 17:50, , 11F
02/10 17:50, 11F
→
02/10 17:51, , 12F
02/10 17:51, 12F
→
02/10 17:52, , 13F
02/10 17:52, 13F
→
02/10 17:54, , 14F
02/10 17:54, 14F
→
02/10 17:55, , 15F
02/10 17:55, 15F
Yep
※ 編輯: ssssIssss (223.136.188.70), 02/11/2017 07:26:21