118

submitted 2 days ago by schnurrito@discuss.tchncs.de to c/xkcd@lemmy.world

10 comments fedilink hide all child comments

The best case is O(n), and the worst case is that someone checks why.

you are viewing a single comment's thread
view the rest of the comments

[-] NeatNit@discuss.tchncs.de 8 points 1 day ago* (last edited 1 day ago)

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!

permalink
fedilink
source
hideshow 2 child comments

[-] Gustephan@lemmy.world 5 points 17 hours ago

You should know better too! Behaviour at large n is irrelevant to "best case" complexity analysis of sorting algorithms

permalink
fedilink
source
parent

this post was submitted on 19 Dec 2024

118 points (100.0% liked)

xkcd

8968 readers

155 users here now

A community for a webcomic of romance, sarcasm, math, and language.

founded 2 years ago

MODERATORS

koraro@lemmy.world