sure that's why I said we must stay in the "realm of integers" for a proper binary search.
I'm not sure about the "always" tho
> You might be better off using the << operator:
That's the classic approach, but I would choose a "pure" algorithm using + only, to find the point where adding two integers creates a non-integer.
Cheers Rolf
(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery
In reply to Re^5: Largest integer in 64-bit perl
by LanX
in thread Largest integer in 64-bit perl
by harangzsolt33
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |