A program to explain LINEAR SEARCH using FUNCTIONS

#include <stdio.h>
 
void linear(int b[], int n);
void main()
{
    int a[30], i, n;
    printf("Enter how many numbers you want to input: ");
    scanf("%d", &n);
 
    printf("Enter elements of array:\n");
    for (i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
 
    linear(a, n);
 
    printf("\n");
}
 
void linear(int b[], int m)
{
    int j, key;
    printf("Enter element to be searched: ");
    scanf("%d", &key);
    for (j = 0; j < m; j++)
    {
        if (key == b[j])
        {
            printf("Element found at position %d", j + 1);
            break;
        }
    }
 
    if (j == m)
    {
        printf("Element not found");
    }
}