BinarySearch Example in java(recursive method).

import java.util.*;

public class BinarySearchExample {
public static void main(String[] args) {
Date now = new Date();
System.out.println("Hello World!");
System.out.println("Now: " + now);
System.out.println();
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 n=13;
boolean b=binarySearch(arr,0,arr.length-1,n);
if(b)
{
System.out.println("Yes Element is in array.");
}
else
{
System.out.println("No Element is not in array.");
}
}
static boolean binarySearch(int arr[],int l,int r,int n)
{
if(l<=r)
{
int mid=l+(r-l)/2;
if(arr[mid]==n)
{
return true;
}
else if(n<arr[mid])
{
return binarySearch(arr,l,mid-1,n);
}
else
{
return binarySearch(arr,mid+1,r,n);
}
}
return false;
}
}