class BinarySearch {
public static void main(String[] args) {
int nums[] =new int[]{1,2,3,6,54,89,96,102,205};
System.out.println(Search1(nums, 102));
}
public static int Search1(int[] nums,int target){
int left=0;
int right=nums.length-1;
while (left<=right){
int mid=left+((right-left)>>1);
if (nums[mid]==target) return mid;
else if(nums[mid]>target){
right =mid-1;
}else {
left =mid+1;
}
}
return 1;
}
}