Java Binary Search

/*
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

0 vote195 views1 answer
Given an int variable n that has already been declared and initialized to a positive value, use a do...while loop to print a single line consisting of n asterisks. Use no variables other than n.
Java
0 vote200 views1 answer
Java kommazahl abschneiden
Java
4 votes198 views1 answer
Long to int java 8
Java
0 vote187 views1 answer
Error in .jcall("RJavaTools", "Ljava/lang/Object;", "invokeMethod", cl, : java.util.zip.ZipException: invalid code -- missing end-of-block
Java
0 vote222 views1 answer
Neither bindingresult nor plain target object for bean name spring mvc
Java Spring
0 vote192 views1 answer
Conky cpu temperature
Java
0 vote208 views1 answer
Spring boot MVC config
Java Spring
2 votes190 views1 answer
Why are there no destructors in java?
Java
0 vote225 views1 answer
Android setTextColor not working
Java
2 votes245 views2 answers
Apt install java 11
Java