BinarySearch Using Java

package com.java.basicprograms;
import java.util.*;
public class BinarySearch {

public static void main(String[] args) {
int num,i,arr[],first,last,mid,item;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of elements");
num = sc.nextInt();
arr = new int[num];
System.out.println("Enter the numbers");
for(i=0;i<num;i++)
arr[i]=sc.nextInt();
System.out.println("Enter the element");
item = sc.nextInt();
first=0;
last = num-1;
mid=(first+last)/2;
while(first<=last)
{
if(arr[mid]<item)
first = mid+1;
else if(arr[mid]==item)
{
System.out.println(item +" found at location"+ (mid+1));
break;
}
else
{
last = mid-1;
}
mid = (first+last)/2;

}
if(first>last)
System.out.println(item + " item not found");

}

}