Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. You may assume that the array is sorted, and your method should use a binary search..

Question

What will be an ideal response?

Answer 1

```
public boolean binarySearch(int a, int[] array)
{
int first = 0;
int last = array.length-1;
int mid;
while(first <= last)
{
mid = (first+last)/2;
if(array[mid] == a)
return true;
else if(array[mid] > a)
last = mid - 1;
else
last = mid + 1;

}
return false;
}
```