Binary Search

import java.io.*;
public class BinarySearch
{
public static void main(String[] args)throws IOException
{
int[] arr = new int[10];
int i,n,beg,end,mid;
BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter 10 elements");
for(i=0;i<10;i++)
{
arr[i] = Integer.parseInt(br.readLine());
}
System.out.println("Enter Element to find");
n = Integer.parseInt(br.readLine());
beg =0;
end = arr.length;
while(beg<end)
{
mid = (beg+end)/2;
if(arr[mid] == n)
{
System.out.println("Element Found");
break;
}
else if(n<arr[mid])
{
end = mid-1;
}
else
beg = mid+1;
}
if(beg>=end)
{
System.out.println("Not Found");
}
}
}

/*

Example :-

Enter 10 elements :-

INPUT:

1

2

3

4

5

6

7

8

9

10

Enter Element to find

10

OUTPUT:

Element Found

*/