public class BinarySearch{ public static boolean binarySearch(int[] arr, int target){ int l = arr.length; int left = 0; int right = l - 1; while(left<=right){ int mid = left + (right - left) / 2; if(arr[mid] == target){ return true; } else if(arr[mid]