写代码可以在整型有序数组中查找想要的数字，找到了返回下标，找不到返回 - 1.（折半查找）

#include<stdio.h>
int Binsearch(int key, int arr[], int len)
{
 int left=0;
 int right = len-1;
 while (left <= right)
 {
  int mid = (left + right) / 2;
  if (arr[mid] > key)
  {
   right =mid - 1;
  }
  else if (arr[mid]<key)
  {
   left =mid + 1;
  }
  else
  {
   return mid;
  }   
 }
 return -1;
}
int main()
{
 int arr[] = { 11, 22, 33, 44, 55, 66, 77, 88, 99 };
 int len = sizeof(arr) / sizeof(arr[0]);
 int index = Binsearch(33, arr, len);
 printf("%d\n", index);
 return 0;
}