安安
Big O建立的不是最壞情況執行時間嗎?
為什麼會有平均情況呢?
像是quick sort的worst case是O(n^2)
但平均情況是O(n*logn)
雖然可以理解平均情況的n*logn怎麼來的
Why???
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 219.68.110.58
※ 文章網址: https://www.ptt.cc/bbs/Gossiping/M.1526133734.A.75D.html
→
05/12 22:02, , 1F
05/12 22:02, 1F
推
05/12 22:03, , 2F
05/12 22:03, 2F
推
05/12 22:03, , 3F
05/12 22:03, 3F
→
05/12 22:03, , 4F
05/12 22:03, 4F
→
05/12 22:04, , 5F
05/12 22:04, 5F
![](https://i.imgur.com/3feYSNp.jpg)
→
05/12 22:04, , 6F
05/12 22:04, 6F
推
05/12 22:06, , 7F
05/12 22:06, 7F
推
05/12 22:07, , 8F
05/12 22:07, 8F
推
05/12 22:10, , 9F
05/12 22:10, 9F
噓
05/12 22:15, , 10F
05/12 22:15, 10F
推
05/12 22:16, , 11F
05/12 22:16, 11F
噓
05/12 22:34, , 12F
05/12 22:34, 12F
→
05/12 22:43, , 13F
05/12 22:43, 13F
噓
05/12 22:43, , 14F
05/12 22:43, 14F
→
05/12 23:05, , 15F
05/12 23:05, 15F
推
05/12 23:05, , 16F
05/12 23:05, 16F
→
05/12 23:19, , 17F
05/12 23:19, 17F
噓
05/12 23:47, , 18F
05/12 23:47, 18F