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