Java Binary Search

package algorithm;


public class Binary_Search {


/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String[] s = {"one","two","three","four"};
   System.out.println(search("two",s));
   System.out.println(search("five",s));
}
public static int search(String key, String [] str) {
int l = 0,r = str.length - 1;
while(l<=r) {
int mid = (l+r)>>1;
int cmp = key.compareTo(str[mid]);
if(cmp == 0) {
return mid;
}else if(cmp < 0) {
r = mid - 1;
} else {
l = mid + 1;
}
}
return -1;
}


}