码迷,mamicode.com
首页 > 其他好文 > 详细

正确的二分查找实现

时间:2015-10-25 13:44:21      阅读:167      评论:0      收藏:0      [点我收藏+]

标签:

   public static int binary_search(int[] A, int key, int imin, int imax)  
     {
      // continue searching while [imin,imax] is not empty
      while (imin <= imax)
      {
          // calculate the midpoint for roughly equal partition
          int imid = imin + ((imax - imin) / 2);
          if(A[imid] == key)
            // key found at index imid
            return imid; 
          // determine which subarray to search
          else if (A[imid] < key)
            // change min index to search upper subarray
            imin = imid + 1;
          else         
            // change max index to search lower subarray
            imax = imid - 1;
      }
      // key was not found
      return -1;
    }

 

正确的二分查找实现

标签:

原文地址:http://www.cnblogs.com/marsbible/p/4908605.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!