How many elements would have to be looked (binary search) at in order to find an integer 5000 at element 499 and an integer 7282 at element 686 assuming it's binary search algorithm and the total number of elements in the array are 1000? I do know that for the binary search algorithm you have divide the total number of elements that would be in your array(which is 1000) in half and keep doing until you find the desired element! Can someone help me? Please!
I do have a theory though (see my theory below:)
1000/2= the first element is 500 element
500/2 the next element is 250 element.