Binary search java

/*
Java Implementation of Binary Search Algorithm.
- Assuming the Array is Sorted (Ascending Order)
- returns the Index, if Element found.
- -1, if not found.
*/
public class BinarySearch {

    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
    }
    public static void main(String[] args) {
        int[] list = {1, 2, 3, 4, 7, 9, 11, 12, 15, 19, 23, 36, 54, 87};
        System.out.println(binarysearch(list, 19));
    }
}

Binary search java

/*
Order Agnostic Binary Search
-> works for both Ascending and Descending Order Sorted Arrays.
-> Returns the Index Value of the Element in the Array, if found.
-> -1, if not found.
*/

public class OrderAgnosticBinarySearch {

    public static int BinarySearch(int[] array, int element) {
        int a_pointer = 0;
        int b_pointer = array.length - 1;
        boolean isAscending = array[a_pointer] < array[b_pointer];

        if (array[a_pointer] == element) return a_pointer;
        else 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;

            if (isAscending){
                if (array[midpoint] < element) a_pointer = midpoint + 1;
                else b_pointer = midpoint - 1;
            }
            else {
                if (array[midpoint] > element) a_pointer = midpoint + 1;
                else b_pointer = midpoint - 1;
            }
        }
        return -1;
    }
  
    public static void main(String[] args) {
        int[] list = {87, 63, 60, 54, 53, 51, 41, 36, 12, -1, -12};
        int[] list2 = {12, 15, 19, 27, 36, 45, 55, 69, 87, 90, 120};
        System.out.println(BinarySearch(list, -1)); // Output: 9
        System.out.println(BinarySearch(list2, 55)); // Output: 6
    }
}

Similar codes

32 votes201 views10 answers
Translate
Java
0 vote197 views1 answer
Printing cube root of a number in java
Java
11 votes197 views4 answers
Throw keyword in java
Java
147 votes323 views2 answers
Java scanner stack overflow
Java
5 votes178 views1 answer
Escolher versão java linux
Java
0 vote231 views1 answer
Java bukkit double jump
Java
1 vote178 views1 answer
Overload and override in java
Java
1 vote198 views2 answers
How to check if parsing in integer is possible in java
Java
3 votes200 views1 answer
Android list.length
Java
4 votes196 views2 answers
Java go troght loop object
Java