IMPLEMENT PROGRAM OF BINARY SEARCH DATA STRUCTURE IN JAVA

import java.util.Scanner;
class BinarySearch
{
public static void main(String[] args)
{
Scanner s= new Scanner(System.in);
int n=s.nextInt();
int arr[] =new int[n];
for(int i=0;i<n;i++)
{
arr[i]=s.nextInt();
}
System.out.println("enter value which is find");
int value=s.nextInt();
System.out.println(BinarySearch(arr,n,value));
}
static int BinarySearch(int a[],int size,int value)
{
int mid;
int low=0;
int high=size-1;
while(low<=high)
{
mid=low+(high-low)/2;
if(a[mid]==value)
{
return mid;
}
else if(a[mid]<value)
low=mid+1;
             else
              high=mid-1;
}
return -1;
}
}