二分法计算数组中间坐标

include<stdio.h>
include<stdlib.h>
int binary_search(int arr[], int k, int left, int right)//写一个函数
{
 while (left <= right)/循环
 {
  int mid = left + (right - left) / 2;
  if (arr[mid] < k)
  {
   left = mid + 1;
  }
  else if (arr[mid]>k)
  {
   right = mid - 1;
  }
  else
  {
   return mid;
  }
  
 }
 return -1;
 
}
int main()
{
 int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
 int sz = sizeof(arr) / sizeof(arr[0]);//计算数组大小
 int k = 7;
 int left = 0;
 int right = sz - 1;
 int ret = binary_search(arr, k,1 ,9 );
 if (ret == -1)
 {
  printf("找不到\n");
 }
 else
 {
  printf("找到了,下标是:%d\n", ret);
 }
 system("pause");
 return 0;
}