TempDemp.java

public static int search(int[] nums, int target) { int left = 0; int right = nums.length - 1; while (left <= right) { int mid = left + (right - left) / 2; if (nums[mid] == target) return mid; if (nums[mid] > target) { left = mid + 1; } if (nums[mid] < target) right = mid - 1; System.out.println((nums[mid] > target)+" "+nums[mid] + " " + left + " " + right); } return -1; }