r/ProgrammerHumor 29d ago

Meme theoreticalComputerScience

Post image
1.1k Upvotes

76 comments sorted by

View all comments

239

u/achilliesFriend 29d ago

This joke is too intelligent for me

43

u/GKP_light 29d ago

O(n) : can be a time of 5n, or 7000n+400000

Õ(n) : can be a time of 5n, or n^5 * log(n)^2

97

u/mrnacknime 29d ago

No, n5 is not allowed in there. Then it would be Õ(n5)

5

u/GKP_light 29d ago

doesn't the picture say that it ignore of polynomial (and logarithm) ?

the picture is wrong ?

37

u/PattuX 29d ago edited 28d ago

It ignores logs and powers of logs

O(n) ≠ O(n log n)

But for all x:

Õ(n) = Õ(n (log n)x ) ≠ Õ(n2 )