作者bouwhat (微笑的故事)
看板Grad-ProbAsk
標題[理工] 資結
時間Fri Sep 28 23:50:38 2012
quick sort is the optimal sort of comparison based sort for different number.
(F)
請問為什麼不對?
average和best都是O(nlogn)符合comparison的定義,是不是問題出在optimal???
--
posted from android bbs reader on my samsung GT-I9003
https://market.android.com/details?id=com.bbs.reader
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 27.241.14.7
推 FRAXIS:QuickSort的Worst Case不好吧.. 09/29 02:47
→ bouwhat:所以optimal sort是worse O(nlogn)嗎 09/29 08:03
推 numin:comparison based在worst case最快可達Ω(nlogn),但quick 09/29 15:38
→ numin:sort在worst case是Θ(n^2),所以False。另外optimal是merge 09/29 15:39
→ numin:sort和heap sort。 09/29 15:40
→ bouwhat:感謝!!! 09/29 16:41