Binary Search - Iterative - Java

Playground.java

import java.util.List;

public class Playground {

    public static void main(String[] args) {
        var nums = List.of(1, 2, 3, 15, 35, 53, 81);
        System.out.println("Element 35 exists: " + binarySearch(nums, 35));
        System.out.println("Element 40 exists: " + binarySearch(nums, 40));
    }

    private static boolean binarySearch(List<Integer> nums, int target) {
        int left = 0;
        int right = nums.size() - 1;

        while (left <= right) {
            int mid = left + (right - left) / 2;
            int curr = nums.get(mid);
            if (curr == target) {
                return true;
            } else if (curr < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return false;
    }
}