binary_search_1

来源:互联网 发布:淘宝卖的奶粉是真的吗 编辑:程序博客网 时间:2024/06/15 01:55

int binary_search(int array[], int arrayLen, int key)

{

  int low=0;

  int high = arrayLen-1;

  int mid;

 

  while(low<high)

  {

    mid = (low+high)/2;

    if(key == array[mid])

       return mid;

    else if(key > array[mid])

       low = mid+1;

   else

      high = mid -1;

  }

 

  return -1; //Not find.

}

原创粉丝点击