Binary search routines close to left and right

Close to left: only when Arr[mid]<target is right, nether Lo Propulsion, mid=lo+ ((Hi-lo) >>1), last position in Lo

Close to right: only when arr[mid]>target to the left, upper bound hi Propulsion, mid=lo+ ((hi-lo+1) >>1), last position in hi

public class test649 {public
	static void Main (string[] args) {
		int[] arr={ 1,1,1,1,2,2,3,4,5,6,6,6,7,7,7,7,7,8,9,10,10,17,18,20};
		System.out.println (Binaryleftsearch (arr, 7));
		System.out.println (Binaryrightsearch (arr, 7));
		System.out.println ();
	}
	
	
	
	public static int Binaryleftsearch (int[] arr,int target) {
		int len=arr.length;
		int lo=0,hi=len-1;
		while (Lo
 

 

 
Output

12

16