Binary to find the subscript for an array element (Java)

1. Using binary to find the subscript of an array element
2. But only if the array is sorted.
3. Example:
public static void Main (String ars []) {
int [] number=new int []{2,6,9,45,65,88};
}
Publci staic int GetIndex (int [] Arr,int key) {
int min=0,max=arr.length,mid;
while (Min<=max) {
Mid= (Min+max) >>1;
if (Key>arr[mid]) {
min=mid+1;
}
else if (Key<arr[mid]) {
Max=mid-1;
}
else {
return mid;
}
}
return-1; The data to find is not in the array
}

Binary to find the subscript for an array element (Java)