BinarySearch in the infinite array

Java/binary-tree/ToSearchInInfiniteArray.java

@@ -0,0 +1,33 @@
+public class ToSearchInInfiniteArray {
+    public static void main(String[] args){
+        int[] arr={3,4,5,6,7,89,99,100};
+        int target=89;
+        System.out.println(ans(arr,target));
+    }
+    static int ans(int[] arr, int target){
+        int start=0;
+        int end=1;
+        while(target>arr[end]){
+            int temp=end+1;
+            end=(end-start+1)*2;
+            start=temp;
+        }
+        return binarySearch(arr,target,start,end);
+    }
+    static int binarySearch(int[] arr, int target,int start,int end){
+        while(start<=end){
+            int mid=start+(end-start)/2;
+            if(target<arr[mid]){
+                end=mid-1;
+            }
+            else if(target>arr[mid]){
+                start=mid+1;
+            }
+            else{
+                return mid;
+            }
+
+        }
+        return -1;
+    }
+}