schnurrito to xkcd@lemmy.worldEnglish · 3 days agoxkcd #3026: Linear Sortxkcd.comexternal-linkmessage-square10fedilinkarrow-up1119arrow-down10file-text
arrow-up1119arrow-down1external-linkxkcd #3026: Linear Sortxkcd.comschnurrito to xkcd@lemmy.worldEnglish · 3 days agomessage-square10fedilinkfile-text
minus-squareNeatNitlinkfedilinkEnglisharrow-up9arrow-down1·edit-22 days agoReally annoys me that this is actually O(n log n) because for large enough n the merge sort will take longer than n*1e6 second. Randall should know better!
minus-squareGustephan@lemmy.worldlinkfedilinkEnglisharrow-up5·23 hours agoYou should know better too! Behaviour at large n is irrelevant to “best case” complexity analysis of sorting algorithms
Really annoys me that this is actually O(n log n) because for large enough n the merge sort will take longer than n*1e6 second. Randall should know better!
You should know better too! Behaviour at large n is irrelevant to “best case” complexity analysis of sorting algorithms