/*PROGRAM TO SEARCH AN ELEMENT USING BINARY SEARCH RECURSIVELY*/
#include<stdio.h>
#include<conio.h>

int n,i,a[15],key;
int search(int l,int h)
  {
   int mid;
   if(l>h)
     return -1;
   mid=(l+h)/2;
   if(key==a[mid])
      return mid+1;
   if(key<a[mid])
      return search(l,mid-1);
   else
      return search(mid+1,h);
   }
void main()
   {
    int n,i,pos;
    clrscr();
    printf("Enter the size of the array\n");
    scanf("%d",&n);
    printf("Enter the elements of the array in SORTED order \n");
    for(i=0;i<n;i++)
      scanf("%d",&a[i]);
    printf("Enter the key element to be searched\n");
    scanf("%d",&key);
    pos=search(0,n-1);
    if(pos==-1)
	printf("The key element %d is not found in the array\n",key);
    else
       printf("The key element %d is present at position %d\n",key,pos);
    getch();
}