Binary search.dsa

#include <stdio.h>
int binarysearch ( int arr[], int size,int element){
int mid;
int low = 0;
int high = size -1;
while(low<=high){
mid =(low+high)/2;

if(arr[mid] == element){
return mid;
}
else if(arr[mid]<element){
low = mid +1;
}
else{
high = mid -1;
}

}
return -1;

}
int main(){
int arr[]={1,3,5,7,9,11,13};
int size = sizeof (arr)/sizeof (int);
int element = 5;
int searchindex = binarysearch(arr,size, element);
printf("%d %d\n", element,searchindex);
return 0;
}