Implementation of search

Sequential tree:

#include<stdio.h>

#include<conio.h>

void main()

{

 int a[100],n,i,item,loc=-1;

 clrscr();

 printf("Enter the number of element :\t");

 scanf("%d",&n);

 printf("Enter the numbers :\n");

 for(i=0;i<=n-1;i++)

 {

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

 }

 printf("Enter the no. to be searched :\t");

 scanf("%d",&item);

 for(i=0;i<=n-1;i++)

  {

    if(item==a[i])

     {

       loc=i;

       break;

     }

  }

    if(loc>=0)

      printf("%d is found in position %d",item,loc+1);

      else

      printf("\n Item doesnot exist");

      getch();

 }

Binary:

#include <stdio.h>

#include <conio.h>

int main()

{

   int c, first, last, middle, n, search, array[100];

   printf("Enter number of elements\n");

   scanf("%d",&n);

   printf("Enter %d integers\n", n);

   for (c = 0; c < n; c++)

      scanf("%d",&array[c]);

   printf("Enter value to find\n");

   scanf("%d", &search);

   first = 0;

   last = n - 1;

   middle = (first+last)/2;

   while (first <= last) {

      if (array[middle] < search)

         first = middle + 1;

      else if (array[middle] == search) {

         printf("%d found at location %d.\n", search, middle+1);

         break;

      }

      else

         last = middle - 1;

      middle = (first + last)/2;

   }

   if (first > last)

      printf("Not found! %d is not present in the list.\n", search);

 getch();

}