/Java/Position of an element in infinite sorted array

Position of an element in infinite sorted array

public class InfiniteArray {
  /*
  as the given array is infinite size, we need to find the range,
  where the target element lies.
  we exponentially double the size and checks if the target element greater
  than the array[end]. if true we return the boundaries as new start and end.
  */
  
    public static int[] FindRange(int[] array, int target) {
        int[] ranges = new int[2];
        int start = 0;
        int end = 1;
        while (target > array[end]) {
            int newStart = end+1;
            end = end + (end-start+1)*2;
            start = newStart;
        }
        ranges[0] = start;
        ranges[1] = end;
        return ranges;
    }
    public static int BinarySearch(int[] array, int target) {
        int[] rangeArray = FindRange(array, target);
        int start = rangeArray[0];
        int end = rangeArray[1];

        while (start <= end) {
            int mid = start + (end-start) / 2;
            if (array[mid] < target) start = mid+1;
            else end = mid-1;
            if (array[mid] == target) return mid;
        }
        return -1;
    }
    public static void main(String[] args) {
        int[] list  = new int[]{3, 5, 7, 9, 10, 90, 100, 130, 140, 160, 170};
        System.out.println(BinarySearch(list, 10)); // Output: 4
    }
}

Similar codes

0 vote148 views1 answer
Codepointat java
Java
10 votes160 views4 answers
How to find the sum of an array in java
Java
0 vote149 views1 answer
Spring webflux
Java
2 votes157 views1 answer
What is an error in Java
Java
8 votes163 views3 answers
Java delay
Java
1 vote157 views1 answer
Bouble to bytes[] java
Java
11 votes153 views1 answer
Java one line if else
Java
3 votes162 views2 answers
Random boolean java
Java
0 vote163 views1 answer
Java file search recursive
Java
0 vote156 views1 answer
Private access modifiers
Java