Minimum Number In An Array

Introduction

• In this blog, I am going to explain how to find the minimum or smallest element present in an array.  

Software Requirements

• Turbo C++ OR C. 

Programming

#include < stdio.h > int main()
{
    int array[100], minimum, size, c, location = 1;
    printf("Enter the number of elements in array\n");
    scanf("%d", & size);
    printf("Enter %d integers\n", size);
    for (c = 0; c < size; c++) scanf("%d", & array[c]);
    minimum = array[0];
    for (c = 1; c < size; c++)
    {
        if (array[c] < minimum)
        {
            minimum = array[c];
            location = c + 1;
        }
    }
    printf("Minimum element is present at location %d and it's value is %d.\n", location, minimum);
    return 0;
}

Explanation

• In the programming, given above, I have clearly explained about the minimum element in an array.
  
   

Output

 

Conclusion 

• Thus, the program has been executed and printed successfully.