Binary Search

1
public int fn(int[] arr, int target) {
2
    int left = 0;
3
    int right = arr.length - 1;
4

5
    while (left <= right) {
6
        int mid = left + (right - left) / 2;
7

8
        if (arr[mid] == target) {
9
            // TODO: logic
10
            return mid;
11
        }
12
        if (arr[mid] > target) {
13
            right = mid - 1;
14
        } else {
15
            left = mid + 1;
16
        }
17
    }
18

19
    return left;
20
}

1
public int fn(int[] arr, int target) {
2
    int left = 0;
3
    int right = arr.length;
4

5
    while (left < right) {
6
        int mid = left + (right - left) / 2;
7

8
        if (arr[mid] >= target) {
9
            right = mid;
10
        } else {
11
            left = mid + 1;
12
        }
13
    }
14

15
    return left;
16
}

1
public int fn(int[] arr, int target) {
2
    int left = 0;
3
    int right = arr.length;
4

5
    while (left < right) {
6
        int mid = left + (right - left) / 2;
7

8
        if (arr[mid] > target) {
9
            right = mid;
10
        } else {
11
            left = mid + 1;
12
        }
13
    }
14

15
    return left;
16
}

1
public int fn(int[] arr) {
2
    int left = MINIMUM_POSSIBLE_ANSWER;
3
    int right = MAXIMUM_POSSIBLE_ANSWER;
4

5
    while (left <= right) {
6
        int mid = left + (right - left) / 2;
7

8
        if (check(mid)) {
9
            left = mid + 1;
10
        } else {
11
            right = mid - 1;
12
        }
13
    }
14

15
    return right;
16
}
17

18
public boolean check(int x) {
19
    return BOOLEAN
20
}

1
public int fn(int[] arr) {
2
    int left = MINIMUM_POSSIBLE_ANSWER;
3
    int right = MAXIMUM_POSSIBLE_ANSWER;
4

5
    while (left <= right) {
6
        int mid = left + (right - left) / 2;
7

8
        if (check(mid)) {
9
            right = mid - 1;
10
        } else {
11
            left = mid + 1;
12
        }
13
    }
14

15
    return left;
16
}
17

18
public boolean check(int x) {
19
    return BOOLEAN
20
}