Implementation of Searching algorithms

Sequential Search

---

Program:

#include<stdio.h>

#define MAX 10 

void main() 

{ 

int array[MAX],index=0,search_element; 

printf("\nEnter the search list(10 elements):"); 

for(index=0;index<10;index++) 

   { 

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

   } 

printf("\nEnter the element to be searched:"); 

scanf("%d",&search_element); 

for(index=0;index<10;index++) 

    { 

if(array[index]==search_element) 

       { 

printf("\nElement %d  found at position %d",array[index],index+1); 

break; 

      } 

    } 

printf("\nElement %d is not present",search_element); 

}  

.
OUTPUT:

Binary Search

---

Program:

#include <stdio.h>

void 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);

}

OUTPUT: