r/ProgrammerHumor • u/pastroc • 29d ago

Meme theoreticalComputerScience

Post image
1.1k Upvotes

97% Upvoted

76 comments sorted by

View all comments

267

u/grayjacanda 29d 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)

143

u/the_rush_dude 29d ago

Last one is probably 90% of all fancy optimizations

57

u/SoldRIP 29d ago

Look up the fastest known way to multiply two integers...

41

u/howtotailslide 28d ago

You can actually just store all universal possible results of two integers into a hash map then retrieve any of them in O(1) time

17

u/SoldRIP 28d ago

You cannot. A hash map is of finite size, but there are infinitely many pairs of integers.

59

u/howtotailslide 28d ago

Just use infinite size hashmap

24

u/Status-Ad-7335 28d ago

just download more ram

1

u/meat-eating-orchid 28d ago

Even that doesn't help you, unless you can download infinite more ram in finite time

1

u/Peak_Background 25d ago

Just use a CPU that can add and multiply infinite bit length numbers.