Binary search

import java.util.*;
public class BinarySearch{
public static void main(String args[]){
Scanner input=new Scanner(System.in);
int n=input.nextInt();
int a[]=new int [n];
for(int i=0;i<a.length;i++){
a[i]=input.nextInt();
}
int k=input.nextInt();
Arrays.sort(a);
int b=0;
int c=a.length-1;
int m=a.length/2;
while(b<=c){
if(a[m]==k){
System.out.println("Element is at"+" "+m+" index position.");
break;
}else if(a[m]<k){
b=m+1;
} else{
c=m-1;
}
m=(b+c)/2;
}
if(b>c){
System.out.println("Element not found");
}
}
}