编辑代码

#include <stdio.h>
int binary_search(int *arr,int p,int q,int ele) {
int mid = 0;
if (p > q) {
return -1;
}
mid = p + (q - p) / 2;
if (ele == arr[mid]) {
return mid;
}
if (ele < arr[mid]) {
return binary_search(arr, p, mid - 1, ele);
}
else {
return binary_search(arr, mid + 1, q, ele);
}
}
int main()
{
int arr[10] = { 10,14,19,26,27,31,33,35,42,44 };
printf("%d", binary_search(arr, 0, 9, 31));
return 0;
}