zlacker

[return to "For algorithms, a little memory outweighs a lot of time"]
1. xlii+s21[view] [source] 2025-05-22 06:32:46
>>makira+(OP)
From the „Camel Book”, one of my favorite programming books (not because it was enlightening, but because it was entertaining); on the Perl philosophy:

“If you’re running out of memory, you can buy more. But if you’re running out of time, you’re screwed.”

◧◩
2. immibi+Kh1[view] [source] 2025-05-22 09:15:33
>>xlii+s21
This can work both ways. If the program needs more memory than the computer has, it can't run until you buy more. But if it takes twice as long, at least it runs at all.
◧◩◪
3. hinkle+TN1[view] [source] 2025-05-22 14:16:34
>>immibi+Kh1
The Camel book was written when Moore’s Law was trucking along. These days you can’t buy much more time but you used to be able to just fine. Now it’s horizontal scaling. Which is still more time.
[go to top]