*********************************************************************************

//LINEAR AND BINARY SEARCH
#include<stdio.h>
#include<process.h>
#include <stdlib.h>
#include<conio.h>

//LinearSearch
int lsearch()
{
    int arr[50],c,s,n,pos=-1;
    printf("\nLinear Search\n");
    printf("Enter the number of elements in array\n");
    scanf("%d",&n);
    for ( c= 0 ; c< n; c++ )
    {
        scanf("%d",&arr[c]);
    }

    printf("\nEnter the element to search\n");
    scanf("%d",&s);

    for ( c= 0 ; c< n; count++ )
    {
        if ( arr[c] == s)
        {
            printf("%d is present at location %d.\n", s, c+1);
            pos=c+1;
            break;
        }
    }
return pos
}

//Binary Search
int bsearch()
{
    int count, l, u, middle, arr[50],n,c,s;
    printf("Binary Search\n");
    printf("Enter number of elements of array\n");
    scanf("%d",&n);
    for ( c= 0 ; c< n; c++ )
    {
        scanf("%d",&arr[c]);
    }

    printf("\nEnter element to be searched\n");
    scanf("%d",&s);

    l= 0;
    u= n-1;
    mid = (l+u)/2;

    while( first <= last )
    {
        if ( arr[mid] <s)
        {
            l= mid+1;   
        }
        else if ( arr[mid]==s)
        {
            printf("%d Element found at location %d.\n",s, mid+1);
            pos=mid+1;
            break;
        }
        else
        {
            u= mid-1;
        }
        mid= (l+u)/2;
    }
return pos;
}
void main()
{
    int choice,loc;
   clrscr();
   printf("\n1.BINARY SEARCH\n2.LINEAR SEARCH\n3.EXIT\n");
    printf("\nENTER YOUR CHOICE");
    scanf("%d", &choice);

   switch (choice)
    {
    case 1:loc=bsearch();
         if(loc>1)
        bsearch();
        else
         printf("\nElement Not Found");
        break;
    case 2:loc=lsearch();
         if(loc>1)
        lsearch();
        else
         printf("\nElement Not Found");       
        break;
    case 3:
        exit(0);
        break;
     default :printf("Enter correct choice");
    }
    getch();
}
Click here for Algorithm

*********************************************************************************