#include<stdio.h>
#include<conio.h>
int linsearch(int,int a[],int);
int binsearch(int,int a[],int);
void main()
{

 char ch;
 printf("***************M E N U*****************");
 printf("  \nLinear search        l\nBinary search        b");
 printf("  \nFibonacci search     f");
 printf("\nEnter your choice\n");
 scanf("%c",ch);
 switch(ch)
 {
  case 'l':
  case 'L':
	   {
	      int n,i; float a[10],x;
	      printf("Enter the no. of elements: ");
	      scanf("%d", &n);
	      printf("Enter %d elements \n", n);
	      for(i=0;i<=n;i++)
	      scanf("%f", &a[i]);
	      linsearch(x,a[],n);
	      if(linsearch()==-1) printf("Element not found.");
	      else printf("The element found at position %d", linsearch());
	   }
  case 'b':
  case 'B':
	   {
	     printf("Enter the no. of elements: ");
	     scanf("%d", &n);
	     printf("Enter %d elements in ascending order\n", n);
	     for(i=0;i<=n;i++)
	     scanf("%f", a[i]);
	     binsearch(x,a[],n);
	   }
   case 'f':
   case 'F':


   }
  getch();
 }

 int  linsearch(int x, int a[], int n)
 {
  int i;
  for(i=0;i<=n;i++)
  if(x==a[i])  return i;  return (-1);
 }

 binsearch(int x, int a[],int n)
 {
  int low, high, mid;
  low=0;
  high=n-1;
  while(low<=high)
  {
   mid=(low+high)/2;
   if(x<a[mid])  high=mid-1;
   else if(x>a[mid])  low=mid+1;
   else return(mid);
  }
  return(-1);
 }