Binary Search Code in java using Recursion
class BinarySearchExample1{
public static int binarySearch(int arr[], int first, int last, int key)
{
if (last>=first)
{
int mid = first + (last - first)/2;
if (arr[mid] == key)
{
return mid;
}
if (arr[mid] > key)
{
return binarySearch(arr, first, mid-1, key);//search in left subarray
}else
{
return binarySearch(arr, mid+1, last, key);//search in right subarray
}
}
return -1;
}
public static void main(String args[]){
int arr[] = {20,40,50,60,70};
int key = 40;
int last=arr.length-1;
int result = binarySearch(arr,0,last,key);
if (result == -1)
System.out.println("Element is not found!");
else
System.out.println("Element is found at index: "+result);
}
}
OUTPUT
Element is found at index: 1
No comments:
Post a Comment