re: Notes on algorithms VIEW POST


To prevent integer overflow for large numbers which could end up being too big to fit the integer's storage space.


Aha, I see
So we get the difference first and divide it by 2 then add it to the start.
instead of adding the start and the end.
But why we didn't do the same with the js example ?!

To highlight both possibilities? You don't always have to worry about overflow; When you do, it's nice to know there's a simple solution. These are just notes.

code of conduct - report abuse