package testing;

public class JunitTesting {
	int binary_search(int l, int r, String goal, String s[]) {
		try {
			while(l<=r) {
				int mid = l + (r-l)/2;

				if(s[mid].equals(goal)) {
					return mid;
				}
				else if(s[mid].compareTo(goal)<0) {
					l = mid+1;
				}
				else {
					r = mid-1;
				}
			}
			return l;
		}
		catch(Exception e) {
			return s.length;
		}

	}
	public String  search(String s[], String goal) {

		int index = binary_search(0,s.length-1,goal, s);
		if(index>=s.length || index<0) {
			return "NONE";
		}
		else {
			return s[index];
		}
	}
}