this post was submitted on 02 Aug 2024
226 points (96.3% liked)

Programmer Humor

19423 readers
218 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 1 year ago
MODERATORS
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev
pylapp@programming.dev
226
O of what now (sh.itjust.works)
submitted 2 months ago by alphacyberranger@sh.itjust.works to c/programmer_humor@programming.dev
19 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] Venator@lemmy.nz 2 points 2 months ago* (last edited 2 months ago) (3 children)

Why would you want a specific time complexity? Wouldn't it be better if it's faster? /s

[–] JaddedFauceet@lemmy.world 5 points 2 months ago (2 children)

Likely they want a lower time complexity.

for example a question can be trivially solved in O(n^2). but there is no know < O(n) solution, so they ask for O(n)

[–] tiefling@lemmy.blahaj.zone 2 points 2 months ago* (last edited 2 months ago)

Most of the time O(n^2) is optimized to O(n log n). You'll get some sort of award if you can figure out a sorting function that runs in O(n).

[–] sukhmel@programming.dev 1 points 2 months ago

That's a huge leap from O(n²) to O(n), in this example it would likely good to at least specify that it should be strictly less than best known solution (not sure if there are such cases on leet code, I thought they only restrict you to what is known to be solvable)