Answer 1

in binary search, you are eliminating half of the possibilities every iteration. if your array is sorted, you know that everything above your middle index has a higher value and everything below has a lower value. if you are looking for 100 and the middle index has 500, you don't need to look higher because 100 will not be there. in an unsorted array, the number could appear anywhere so you do have to check for it.