查找算法之二分查找

最新推荐文章于 2024-09-14 22:25:23 发布

给思维做按摩

最新推荐文章于 2024-09-14 22:25:23 发布

阅读量469

点赞数

分类专栏：经典查找算法文章标签：二分查找算法 search c语言计算机

本文链接：https://blog.csdn.net/luozhaowork/article/details/10285387

版权

经典查找算法专栏收录该内容

0 篇文章 0 订阅

订阅专栏

正确的二分查找程序！

int search (int array[], int n, int v)
{
      int left,right,middle;
      left = 0;
      right = n - 1;
      while(left <= right)
      {
              middle = (left +right)/2;
              if(array[middle] > v)
              {
                     right = middle - 1;
               }
               else if(array[middle] < v)
               {
                     left = middle + 1;
                }
               else 
                      return middle;
       }
       return -1;
}
------------------------------------------------------------------------------

------------------------------------------------------------------------------
int search (int array[], int n, int v)
{
      int left,right,middle;
      left = 0;
      right = n;
      while(left <= right)
      {
              middle = (left +right)/2;
              if(array[middle] > v)
              {
                     right = middle;
               }
               else if(array[middle] < v)
               {
                     left = middle + 1;
                }
               else 
                      return middle;
       }
       return -1;
}