推 Bearcome:2.O(n^2)=O(5^2)=O(25)=O(1) 12/22 16:13
→ bouwhat:感謝~那請教第一題 12/24 20:10
想請教兩個問題：
1.we modify merge sort as follow:
若<k elements 則使用insertion sort來解，where k<=n
則問worst case time complexity?
(96清大)
2.為什麼prune and search的找第k小數演算法第二步驟的排序是O(1)？
要怎麼做？
step2:把每個集合5個點排序並找出每組的中位數
--
posted from android bbs reader on my samsung GT-I9003
https://market.android.com/details?id=com.bbs.reader
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 39.12.56.238