[理工] [algo]- sorting
Please answer "True" or "False" for the following questions.
1. The lower bound of worst case time complexity of sort algorithms isΩ(nlogn)
ANS: False
除了counting sort以外,其他的演算法的worst case的最佳時間複雜度應該是nlogn,
一般而言應該是不考慮counting sort的,不是嗎?
不知道該怎麼解釋,謝謝指教。
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.134.129.184
→
01/05 01:07, , 1F
01/05 01:07, 1F
→
01/05 04:47, , 2F
01/05 04:47, 2F
推
01/06 00:10, , 3F
01/06 00:10, 3F
→
01/06 09:20, , 4F
01/06 09:20, 4F
→
01/07 00:52, , 5F
01/07 00:52, 5F