Binary Search in Java

Java Binary Search Algorithm

int binarysearch(int[] array, int element) {
    int a_pointer = 0;
    int b_pointer = array.length -1;
    if (array[a_pointer] == element) return a_pointer;
    if (array[b_pointer] == element) return b_pointer;

    while(a_pointer <= b_pointer){
        int midpoint = a_pointer + (b_pointer - a_pointer) / 2;
        if (array[midpoint] == element) return midpoint;
      
        // ignoring the left half, if this is True.
        if (array[midpoint] < element) a_pointer = midpoint + 1;
      
        // ignoring the right half, if this is True.
        else if (array[midpoint] > element) b_pointer = midpoint - 1;
    }
    return -1;	// Element not Found
}

binary search in java:

public static void main(String[] args) {
    int[] arr = { 1,4,2,7,5,16,12,8,13,28 };
    System.out.println(binarysearch(arr, 13));
}