Searching in C Language -- half-Lookup

Searching in C Language -- half-Lookup
Problem: In a series of ordered columns, the half-lookup method often gets twice the result with half the effort.

# Include <stdio. h> int main () {printf ("Enter the one you want to search for (1 ~ 10) number \ n "); int I; scanf_s (" % d ", & I); int arr [10] =, 9, 10}; int start = 1, end = 10, mid; while (start <= end) {mid = (start + end)/2; if (arr [mid]> I) {end = mid-1;} else if (arr [mid] <I) {start = mid + 1 ;} else {printf ("The number you are looking for is % d \ n", arr [mid]); break ;}} return 0 ;}