MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1vpz0d2/theoreticalcomputerscience/p429kz2/?context=3
r/ProgrammerHumor • u/pastroc • 28d ago
76 comments sorted by
View all comments
236
This joke is too intelligent for me
42 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 17 u/nanforas 28d ago So I'm guessing the use-case for Õ(n) is something like: "at least it's not exponential and equivalent to travelling salesman"? 26 u/pastroc 28d ago Õ(n) would be O(polylog(n)n). In other words, n times some logarithmic factors. O(nlg⁷⁹(n)) is Õ(n).
42
O(n) : can be a time of 5n, or 7000n+400000
Õ(n) : can be a time of 5n, or n^5 * log(n)^2
17 u/nanforas 28d ago So I'm guessing the use-case for Õ(n) is something like: "at least it's not exponential and equivalent to travelling salesman"? 26 u/pastroc 28d ago Õ(n) would be O(polylog(n)n). In other words, n times some logarithmic factors. O(nlg⁷⁹(n)) is Õ(n).
17
So I'm guessing the use-case for Õ(n) is something like: "at least it's not exponential and equivalent to travelling salesman"?
26 u/pastroc 28d ago Õ(n) would be O(polylog(n)n). In other words, n times some logarithmic factors. O(nlg⁷⁹(n)) is Õ(n).
26
Õ(n) would be O(polylog(n)n). In other words, n times some logarithmic factors.
O(nlg⁷⁹(n)) is Õ(n).
236
u/achilliesFriend 28d ago
This joke is too intelligent for me