Question

in binary search when assign variable mid=(last+upper)/2 it can lead to over flow why?

Answer 1

Hoot! You just asked your first question! Hang tight while I find people to answer it for you. You can thank people who give you good answers by clicking the 'Good Answer' button on the right!

Answer 2

If whatever you're searching is in a high memory location, the addition of the addresses of last and upper can equal more than an integer (especially a signed interger) can handle. It's not too likely, but possible.