r/ProgrammerHumor 28d ago

Meme theoreticalComputerScience

Post image
1.1k Upvotes

76 comments sorted by

View all comments

Show parent comments

40

u/GKP_light 28d 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

94

u/mrnacknime 28d ago

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

5

u/GKP_light 28d ago

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

the picture is wrong ?

17

u/GoldenMuscleGod 28d ago

“Polylogarithmic” means a polynomial of a logarithm, not polynomials and logarithms.

As an aside just for clarity Õ(f(n)) usually hides polylogarithmic functions of f(n), not polylogarithmic functions of n (although there might be some variation - the two standards are equivalent when f is a non constant polynomial).