Link
click to show
click to show
https://www.quora.com/Why-is-the-%CE%A9-n-log-n-lower-bound-on-comparison-sorting-algorithms-called-the-information-theoretic-limit
這是在一般的 sort 為什麼最低 O(n log n ) 的解釋
Messagehttps://www.quora.com/Why-is-the-%CE%A9-n-log-n-lower-bound-on-comparison-sorting-algorithms-called-the-information-theo…
30 June 2019Nearby in the feed
Lthis message
L