C语言 -- 折半查找

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int max(){
int arr[] = {1, 2, 3, 4, 5, 6, 7};   //必须是已经排好序
int count = sizeof(arr) / sizeof(arr[0]);
int left = 0, right = count - 1;
int mid = (left + right) / 2;
int x = 0;
printf("输入你要查找的数字：%d", &x);
while(mid >= 0){

if(arr[mid] < x){
left = mid +1;
}
else if(arr[mid] > x){
right = mid - 1;
}
else{
printf("你要找的数字所在位置为%d", mid);
break;
}

}

if(arr[mid] != x){
printf("你要找的数字不存在");
}

return 0；
}