二分查找的技巧

public class TwoDivi
{
  public static int search(int[]b,int x)
   {
      int l,m,n;
      l=0;
      m=b.length-1;
    while(l<=m)
     {
      n=(m+l)/2;
	 if(b[n]>x)           
           m=n-1;
       else if(b[n]<x)
           l=n+1;
       else 
           return  n;
     }
       return -1;  
   }
  public static void main(String args[])
   {
      int []a=new int[]{0,1,2,3,4,5,6,7,8,9};
      int value=11; 
      System.out.println(search(a,value));
   }
}