3 ms·
How big are we talking? The benchmarks I tried the two numbers in your example, but yes, if you go above 2^53, then you will run into trouble with the naive sol
by asQuirreL 3y ago
How big are we talking? The benchmarks I tried the two numbers in your example, but yes, if you go above 2^53, then you will run into trouble with the naive solution, but that is for correctness reasons, not performance reasons.
- ColinWright 3y agoThis is an experiment on aspects of a factoring algorithm ... we're going to be talking about a few hundred digits base 10. So up to around 10^200 or so, which is around 2^600.
- asQuirreL 3y agoWell yes, that definitely changes the game!!