First page Back Continue Last page Overview Graphics
Largest value that can be represented is 2N - 1.
For 32-bit word this is 4,294,967,295.
Arithmetic with integers is exact, except:
- When division results in remainder.
- Result exceeds largest representable integer
- e.g. 2 109 + 3 109 = overflow error
Note multiplication by 2's can be achieved by left-shift, which is very fast (in C: "<<" operator).