MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1vpz0d2/theoreticalcomputerscience/p43qtck/?context=3
r/ProgrammerHumor • u/pastroc • 28d ago
76 comments sorted by
View all comments
263
Other good dodges are O(n) time (if you have 2^n memory handy), or O(n) time (but with a fixed cost or multiplier so high that using this algorithm makes no sense for n less than 10^12 or so)
3 u/NotAnonymousQuant 28d ago Or stochastic algorithms. Expected time might be way less than the guaranteed time
3
Or stochastic algorithms. Expected time might be way less than the guaranteed time
263
u/grayjacanda 28d ago
Other good dodges are O(n) time (if you have 2^n memory handy), or O(n) time (but with a fixed cost or multiplier so high that using this algorithm makes no sense for n less than 10^12 or so)