C PROGRAM BINARY SEARCH THROUGH RECURSSION Function

#include
int main(){
  int a[10],i,n,m,c,l,u;
  printf("Enter the size of an array =>");
  scanf("%d",&n);
  printf("\nEnter the elements of an array =>");
  for(i=0;i    scanf("%d",&a[i]);
  }
  printf("\nThe elements of an array are =>");
  for(i=0;i    printf(" %d",a[i]);
  }
  printf("\nEnter the number to be search =>");
  scanf("%d",&m);
  l=0,u=n-1;
  c=binary(a,n,m,l,u);
  if(c==0)
    printf("\nThe number is not in the list");
  else
     printf("\nThe number is found");
   return 0;
 }

 int binary(int a[],int n,int m,int l,int u)
{
   int mid,c=0;
   if(l<=u){
     mid=(l+u)/2;
      if(m==a[mid])
 {
          c=1;
      }
      else if(m<=a[mid])
 {
          return binary(a,n,m,l,mid-1);
      }
      else
          return binary(a,n,m,mid+1,u);
    }
   else
         return c;
  }

Related Links :