BINARY SEARCH USING RECURSION

Write a simple code for binary search using function recursion in c programming language

#include

int main(){

    int a[10],i,n,m,c,l,u;

    printf("Enter the size of an array: ");

    scanf("%d",&n);

    printf("Enter the elements of the array: " );

    for(i=0;i

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

    }

    printf("Enter the number to be search: ");

    scanf("%d",&m);

    l=0,u=n-1;

    c=binary(a,n,m,l,u);

    if(c==0)

         printf("Number is not found.");

    else

         printf("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

              return binary(a,n,m,l,mid-1);

          }

          else

              return binary(a,n,m,mid+1,u);

     }

     else

       return c;

}

Sample output:

Enter the size of an array: 5

Enter the elements of the array: 8 9 10 11 12

Enter the number to be search: 8

Number is found.