Classic Binary Search

public class BinarySearch{
    public int BinarySearch(int[] array, int target){
        if(array == null || array.length = 0){
            return -1;
        }
        while (left < right){
            int mid = left + (right - left)/2;
            if (array[mid] == target){
                return mid;
            } else if (array[mid] > target) {
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        return -1;
     }
}