package liu.dh.algorithm1;
public class CopyOfTestBinary {
/**
  * @param args
  */
public static void main(String[] args) {
  // TODO Auto-generated method stub
  //1-100之间的数,给定一个数几次查找能够找到这个数;
  //查找search=34,看几次能够找到
  int first =1;
  int laste = 100;
  int count = 0;
  
  
  while (true) {
   int mid = (first+laste)/2;
   int search =26;
   if (mid==search) {
    count++;
    break;
   
   }else if (mid>search) {
    laste=mid;
    count++;
   
   }else if (mid<search) {
    first=mid;
    count++;
   }
  }
  System.out.println(count);
}
}

package liu.dh.algorithm1;
public class CopyOfTestBinary {
/**
  * @param args
  */
public static void main(String[] args) {
  // TODO Auto-generated method stub
  //1-100之间的数,给定一个数几次查找能够找到这个数;
  //查找search=34,看几次能够找到
  int first =1;
  int laste = 100;
  int count = 0;
  
  
  while (true) {
   int mid = (first+laste)/2;
   int search =26;
   if (mid==search) {
    count++;
    break;
   
   }else if (mid>search) {
    laste=mid;
    count++;
   
   }else if (mid<search) {
    first=mid;
    count++;
   }
  }
  System.out.println(count);
}
}