BinarySearch Example in java(iterative method)

import java.util.;
import java.io.;

class BinarySearchExample2
{
static boolean binarySearch(int arr[],int low,int high,int num)
{
while(low<=high)
{
int mid=low+(high-low)/2;
if(arr[mid]==num)
{
return true;
}
else if(num<arr[mid])
{
high=mid-1;
}
else
{
low=mid+1;
}
}
return false;
}
public static void main(String[] args)
{
Date now=new Date();
System.out.println("Today's Date and Time is:"+now);
int arr[]={12,9,13,6,4,10};
Arrays.sort(arr);
for(int i=0;i<arr.length;i++)
{
System.out.print(arr[i]+" ");
}
System.out.println();
int num=4;
boolean b=binarySearch(arr,0,arr.length-1,num);
if(b)
{
System.out.println("Yes Element present in the Array.");
}
else
{
System.out.println("No Element is not in the Array.");
}
}
}