Binary search recursive implementation

BinarySearch.java

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

    public static boolean binarySearch(int[] arr, int left, int right, int num) {

        if (left <= right) {
            int mid = (left + right) / 2;
            // base case
            if (arr[mid] == num) {
                return true;
            }
            if (num < arr[mid]) {
                return binarySearch(arr, left, mid-1, num);
            } else {
                return binarySearch(arr, mid+1, right, num);
            }
        }
        return false;
    }
}