Java Binary Search method

public class Querydemo {public static void main (string[] args) {int[] arr2 = new int[] {11, 3,32,34, 45, 56, 78}; System.out.println ("67 in the array position:" + halfsearch (ARR2, 11));} public static int Halfsearch (int[] arr, int value) {//define 3 variables min, Mid, maxint min = 0;int max = Arr.length-1;int mid = (min + max)/2;while (Value! = Arr[mid]) {//Determine if (Value > Arr[mid]) {//on right min = mid + 1;} else {//on Left max = mid-1; }//Update Midmid = (min + max)/2;//The proof data is not queried to if (Min > Max) {mid = -1;break;}} When the minimum angle is greater than the maximum angle index return mid;}}

Java Binary Search method