This C program uses linear search technique to find minimum element in an array.

This algorithm searches an array sequentially to find the minimum element in O(n) time.

Here is the source code of the C program to find and display minimum element in an array. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

`#include <stdio.h>`

`#define MAX 10`

int min_linearsearch(int numbers[])

`{`

int min = numbers[0];

int i;

for (i = 1; i < MAX; i++)

`{`

if (min > numbers[i])

min = numbers[i];

`}`

return min;

`}`

int main() {

int numbers[MAX];

int i;

int min ;

printf("Enter %d numbers : ", MAX);

for (i = 0; i < MAX; i++)

`{`

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

`}`

min = min_linearsearch(numbers);

printf("\nMinimum number in the array is : %d\n", min);

return 0;

`}`

$ gcc minelement.c -o minelement $ ./minelement Enter 10 numbers : 345 3 20 35 333 45 654 16 74 449 Minimum number in the array is : 3

**Sanfoundry Global Education & Learning Series – 1000 C Programs.**

Here’s the list of Best Reference Books in C Programming, Data Structures and Algorithms.