Programmer Humor

19564 readers

1010 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

Keep content in english
No advertisements
Posts must be related to programming or programmer topics

founded 1 year ago

MODERATORS

[email protected]

229

O of what now (sh.itjust.works)

submitted 3 months ago by [email protected] to c/[email protected]

19 comments fedilink hide all child comments

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

[–] [email protected] 2 points 3 months ago* (last edited 3 months ago) (3 children)

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

[–] [email protected] 5 points 3 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)

[–] [email protected] 2 points 3 months ago* (last edited 3 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).

[–] [email protected] 1 points 3 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)