SEP -DATA STRUCTURE

PART-A

PROGRAM 1 PROGRAM 2 PROGRAM 3 PROGRAM 4 PROGRAM 5 PROGRAM 6 PROGRAM 7 PROGRAM 8

PART-B

PROGRAM B1 PROGRAM B2 PROGRAM B3 PROGRAM B4 PROGRAM B5 PROGRAM B6 PROGRAM B7 PROGRAM B8 . . .

 
 

/* 8.Write a C Program to search an element using linear search technique*/

 

#include < stdio.h>

#include < conio.h>

int search(int arr[], int N, int x)
{
 int i;
    for (i = 0; i < N; i++)
        if (arr[i] == x)
            return i;
    return -1;
}




void main(void)
{
    int arr[] = { 2, 3, 4, 10, 40 }, result;
    int x = 10;
    int N = sizeof(arr) / sizeof(arr[0]);

    // Function call
    result = search(arr, N, x);
    
    (result == -1)  ? printf("Element is not present in array")  : printf("Element is present at index %d", result);
    
  getch();
}