class Demo{
public static void main(String[] args)
{
int[]arr={7,13,24,34,56,77,88};
int index=halfSearch(arr,56);
System.out.println(index);
}
public static int halfSearch(int[]arr,int key)
{
int min=0;
int max=arr.length-1;
int mid=(min+max)/2;
while(arr[mid]!=key)
{
if(arr[mid]<key)
min=mid+1;
else if(arr[mid]>key)
max=mid-1;
if(max<min)
return -1;
mid=(min+max)/2;
}
return mid;
}
} |
|