#include <stdio.h>
#include <stdlib.h>
int recursiveBinary(int a[],int start,int end,int numToSearch);
int main()
{
  int array[10]= { 1,2,3,4,5,6,7,8,9,10},n=10,numToFind = 7;
  int found = recursiveBinary(array,0,n-1,numToFind);
  printf("Found = %d\n",found);
  return 0;
}
int recursiveBinary(int a[],int start,int end,int numToSearch)
{
  if(start == end)
  {
    if(a[start] == numToSearch)
      return 1;
    else
      return 0;
  }
  int mid = (start + end)/2;
  if(a[mid] > numToSearch)
    return recursiveBinary(a,start,mid,numToSearch);
  else if(a[mid] < numToSearch)
    return recursiveBinary(a,mid+1,end,numToSearch);
  else
    return 1;
}