Binary search iterative solution

BinarySearch.java

class BinarySearch {
    public static void main(String[] args) {
        int[] arr = new int[]{1, 2, 3, 4, 5};
        System.out.println(binarySearch(arr,4));
    }

    public static boolean binarySearch(int[] arr, int num) {
        int low = 0;
        int high = arr.length-1;

        while (low <= high) {
            // base case
            int mid = (low + high)/2;
            if (arr[mid] == num) {
                return true;
            }
            if (num < arr[mid]) {
                low = 0;
                high = mid-1;
            } else {
                low = mid + 1;
                high = arr.length-1;
            }
        }
        return false;
    }
}