折半查找法——在有序整形数组中寻找

#include<stdio.h>
#include<Windows.h>
int main()
{
 int arr[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
 int mid = 0;
 int left = 0;
 int right = sizeof arr / sizeof arr[0] - 1;
 int key = 7;
 while (left<=right)
 {
  mid = left + (right - left) / 2;  //计算中间下标（防止溢出）
  if (arr[mid] < key)
  {
   left = mid + 1;
  }
  else if (arr[mid]>key)
  {
   right = mid - 1;
  }
  else
  {
   printf("找到了:%d\n", mid);
   break;  //找到了返回下标
  }
 }
 if (left > right)

  printf("-1\n");  //找不到返回-1
 system("pause");
 return 0;
}