Binary search program using java

import java.io.*;
class bin_search
{
public void arr_chk()throws IOException
{
BufferedReader br=new BufferedReader(
new InputStreamReader(System.in));
int n,ser,i;
System.out.print("Enter number :-");
n=Integer.parseInt(br.readLine());
int ar[]=new int[n];
for(i=0;i<n;i++)
{
System.out.print("Enter element :-");
ar[i]=Integer.parseInt(br.readLine());
}
System.out.print("Enter search ele :-");
ser=Integer.parseInt(br.readLine());
b_search(ar,n,ser);
}

void sort(int ar[],int n)
{
int i,j,t;
for(i=0;i<n-1;i++)
{
for(j=(i+1);j<n;j++)
{
if(ar[i]>ar[j])
{
t=ar[i];
ar[i]=ar[j];
ar[j]=t;
}
}
}
}
void b_search(int ar[],int n,int ser)
{
sort(ar,n);
int ub,lb,mb=0,f=0;
lb=0;
ub=(n-1);
while(lb<=ub)
{
mb=(lb+ub)/2;
if(ar[mb] == ser)
{
f=1;
break;
}
if(ser > ar[mb])
lb=mb+1;
else
ub=mb-1;
}
if(f == 0)
System.out.println("Search element not found....");
else
System.out.println("Search element found at :-"+mb);
}

}