package Prog;
public class BinarySearch
{
static int binarySearch(int a[], int beg, int end, int item)
{
int mid;
while(end >= beg)
{
mid = (beg + end)/2;
if(a[mid] == item)
{
return mid+1;
}
else if(a[mid] < item)
{
beg = mid + 1;
}
else
{
end = mid - 1;
}
}
return -1;
}
public static void main(String args[]){
int arr[] = {10,20,30,40,50,60};
int key = 30;
int last=arr.length-1;
if (binarySearch(arr,0,last,key)>0)
System.out.println("item found at location ="+ binarySearch(arr,0,last,key));
else
System.out.println("item not found");
}
}
output:
item found at location =3
public class BinarySearch
{
static int binarySearch(int a[], int beg, int end, int item)
{
int mid;
while(end >= beg)
{
mid = (beg + end)/2;
if(a[mid] == item)
{
return mid+1;
}
else if(a[mid] < item)
{
beg = mid + 1;
}
else
{
end = mid - 1;
}
}
return -1;
}
public static void main(String args[]){
int arr[] = {10,20,30,40,50,60};
int key = 30;
int last=arr.length-1;
if (binarySearch(arr,0,last,key)>0)
System.out.println("item found at location ="+ binarySearch(arr,0,last,key));
else
System.out.println("item not found");
}
}
output:
item found at location =3
0 Comments