public class Search{
public int search(int[] arr,target){
int l = 0;
int r = arr.length-1;
int mid = 0;
while(l<r){
mid = l+(r-l)/2;
if(arr[mid]<target){
l = mid+1;
}else if(arr[mid]>target){
r = mid-1;
}else{
return mid;
}
}
return -1;
}
}