[理工] DS 101交大
Sorting 6 elements with a comparison sort require
at least how many comparisons in the worst case?
答案是10
但我用HEAPSORT 算完是六次
還是他連建樹的比較也有考慮進去
但如果考慮進去好像就破表了
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.121.140.145
→
01/15 17:27, , 1F
01/15 17:27, 1F
→
01/15 17:28, , 2F
01/15 17:28, 2F
→
01/15 17:28, , 3F
01/15 17:28, 3F
→
01/15 17:29, , 4F
01/15 17:29, 4F
→
01/15 19:59, , 5F
01/15 19:59, 5F
→
01/15 19:59, , 6F
01/15 19:59, 6F