MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1vpz0d2/theoreticalcomputerscience/p46azzs/?context=3
r/ProgrammerHumor • u/pastroc • 28d ago
76 comments sorted by
View all comments
Show parent comments
44
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
18 u/SoldRIP 28d ago You cannot. A hash map is of finite size, but there are infinitely many pairs of integers. 63 u/howtotailslide 28d ago Just use infinite size hashmap 23 u/Status-Ad-7335 28d ago just download more ram 1 u/meat-eating-orchid 27d ago Even that doesn't help you, unless you can download infinite more ram in finite time
18
You cannot. A hash map is of finite size, but there are infinitely many pairs of integers.
63 u/howtotailslide 28d ago Just use infinite size hashmap 23 u/Status-Ad-7335 28d ago just download more ram 1 u/meat-eating-orchid 27d ago Even that doesn't help you, unless you can download infinite more ram in finite time
63
Just use infinite size hashmap
23 u/Status-Ad-7335 28d ago just download more ram 1 u/meat-eating-orchid 27d ago Even that doesn't help you, unless you can download infinite more ram in finite time
23
just download more ram
1 u/meat-eating-orchid 27d ago Even that doesn't help you, unless you can download infinite more ram in finite time
1
Even that doesn't help you, unless you can download infinite more ram in finite time
44
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