Binary Search

#include<stdio.h>

//Binary Search Function

int BinarySearch(int a[], int low, int high, int target){

int mid;

mid = (low + high) / 2;

if(a[mid] == target){

return mid;

}

else if(a[mid] < target){

return BinarySearch(a,low,mid - 1 , target);

}

else{

return BinarySearch(a,low,mid + 1,target);

}

}

int main(){

int arr[100],i,n,value,result;

printf("Enter size of number: ");

scanf("%d", &n);

for(i = 0 ; i < n ; i++){

printf("Enter value: ");

scanf("%d", &arr[i]);

}

printf("Enter Target value: ");

scanf("%d", &value);

result = BinarySearch(arr,0,n - 1,value);

printf("%d is the result", result);

}