schnurrito to xkcd@lemmy.worldEnglish · 2 months agoxkcd #3026: Linear Sortxkcd.comexternal-linkmessage-square12fedilinkarrow-up1125arrow-down10file-text
arrow-up1125arrow-down1external-linkxkcd #3026: Linear Sortxkcd.comschnurrito to xkcd@lemmy.worldEnglish · 2 months agomessage-square12fedilinkfile-text
minus-squareNeatNitlinkfedilinkEnglisharrow-up11arrow-down1·edit-22 months 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-up5arrow-down1·2 months agoYou should know better too! Behaviour at large n is irrelevant to “best case” complexity analysis of sorting algorithms
minus-squareNeatNitlinkfedilinkEnglisharrow-up2·2 months agoOf course it still matters, you just take the best case for n as n→∞, instead of the worst or average case.
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
Of course it still matters, you just take the best case for n as n→∞, instead of the worst or average case.