在整型有序数组中查找想要的数字

#include<stdio.h>
#include<stdlib.h>
int main()
{
 int arr[10];
 int i;
 printf("请输入一个有序数组\n");
 for (i = 0; i <= 9; i++){
  scanf_s("%d", &arr[i]);
 }
 int left = 0;
 int sz = sizeof(arr) / sizeof(arr[0]);
 int right = sz - 1;
 int mid = right + (right - left) / 2;
 int chazhao;
 printf("请输入需要查找的数：\n");
 scanf_s("%d", &chazhao);
  while (left < right)
 {
  mid = left + (right - left) / 2;
  if (arr[mid] < chazhao){
   left = mid + 1;
  }
  else if (arr[mid] > chazhao){
   right = mid - 1;
  }
  else if (arr[mid] == chazhao){
   printf("需要找的数字的下标是%d\n",mid);
     break;
  }  
 }
 if (left > right){
  printf("找不到\n");
 }
 system("pause");
 return 0;
}