[問題] 資料結構
關於資料結構的問題
何謂"big O"
像以下這種問題
Show if the following statement are correct or incorrect and explain why?
n的三次方乘於2的n次方+6乘於n的二次方乘於3的n次方
等於O(n的二次方乘於2的n次方)
正確答案為O(n的n次方)
有誰看的懂可以教我???
謝謝!!!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 210.240.195.218
推
04/18 15:11, , 1F
04/18 15:11, 1F
→
04/18 15:12, , 2F
04/18 15:12, 2F
→
04/18 15:12, , 3F
04/18 15:12, 3F
→
04/18 15:12, , 4F
04/18 15:12, 4F
→
04/18 15:13, , 5F
04/18 15:13, 5F
推
04/19 03:43, , 6F
04/19 03:43, 6F
→
04/19 03:43, , 7F
04/19 03:43, 7F
→
04/19 03:50, , 8F
04/19 03:50, 8F
→
04/19 03:51, , 9F
04/19 03:51, 9F