作者ie925155 (天佑台灣!)
看板Grad-ProbAsk
標題[理工] [DS]98-中山資工
時間Mon Mar 22 21:10:57 2010
Analyze the behavior of QUICKSORT in the case where a schizophrenic adversary
picks the best possible splitter (partitioning element) instead of the worst
,every other time (ie, he alternates between best and worest). What running
time is induced by this "adversary"?
題目不懂在問什麼? 還有請問如何解?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 59.115.4.6
※ 編輯: ie925155 來自: 59.115.4.6 (03/22 21:11)
1F:→ keepoo:阿就問你最佳解怎麼來的及時間複雜度吧? 03/22 21:13
2F:推 assassin88:請問你知道middle of three嗎? 03/22 21:14
3F:→ ie925155:知道 解決QSORT worst case的方法 03/22 21:18
4F:推 AIdrifter:alternates? 我還以為是一下worst 一下best 交替計算> < 03/22 22:02
5F:推 haha31:樓上正解 03/22 22:30