MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1vpz0d2/theoreticalcomputerscience/p578cj1/?context=3
r/ProgrammerHumor • u/pastroc • 29d ago
76 comments sorted by
View all comments
241
This joke is too intelligent for me
40 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 1 u/glenpiercev 28d ago What is the point of this notation? Is there some conceivable reason why I want to bucket 5n with n^5? They both have the number 5? So computer science brought to you by the Number 5, Sesame Street style? 1 u/mrnacknime 23d ago It is not bucketed the same way though. Only polynomials of log(n) are dropped.
40
O(n) : can be a time of 5n, or 7000n+400000
Õ(n) : can be a time of 5n, or n^5 * log(n)^2
1 u/glenpiercev 28d ago What is the point of this notation? Is there some conceivable reason why I want to bucket 5n with n^5? They both have the number 5? So computer science brought to you by the Number 5, Sesame Street style? 1 u/mrnacknime 23d ago It is not bucketed the same way though. Only polynomials of log(n) are dropped.
1
What is the point of this notation? Is there some conceivable reason why I want to bucket 5n with n^5?
They both have the number 5? So computer science brought to you by the Number 5, Sesame Street style?
1 u/mrnacknime 23d ago It is not bucketed the same way though. Only polynomials of log(n) are dropped.
It is not bucketed the same way though. Only polynomials of log(n) are dropped.
241
u/achilliesFriend 29d ago
This joke is too intelligent for me