3 ms·
This function is completely constant in running time, so I don’t think these considerations are important here.
by l33t233372 4y ago
This function is completely constant in running time, so I don’t think these considerations are important here.
- saulpw 4y agoYou can always have a smaller constant!
- l33t233372 4y agoYou sure can, but if you can beat a single IEEE multiplication on an arbitrary processor my god that’s a program I hope to never ever in my life have to reverse engineer.
- dan_mctree 4y agoNever quite got this argument. You can frequently do 1000 fold improvements or do even better by optimizing within the same algorithmic complexity. That frequently flips the bit of "is this software usable". Sometimes you can even make real world performance significantly better by ignoring the technically better algorithmic complexity, especially when you almost always with low n's