#include <stdio.h>
#include <stdlib.h>
int binSearch(int arr[], int len, int i){
int left = 0;
int right = len - 1;
int mid = (left + right) / 2;
while (i !=arr[mid]){
if (i > arr[mid]){
left = mid + 1;
mid = (left + right) / 2;
}
if (i < arr[mid]){
right = mid - 1;
mid = (left + right) / 2;
}
if (left == right && arr[mid]!=i){
return -1;
}
}
return mid;
}
int main(){
int arr[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int index = binSearch(arr,10,7);
printf("%d\n", index);
system(“pause”);
return 0;
}