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

[-] thevoidzero@lemmy.world 1 points 14 hours ago

It'd be easier to do 9e5, 8e5 and so on though. Linear decrease in time with each optimization. 1e5.9 seems risky.

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