Minimum Element in Array in C
  • Twitter
  • Facebook
  • Snapchat
  • Instagram

Minimum Element in Array in C: Program to Find Smallest Element

📑 On this page:
  • Introduction
  • C Program to Find Minimum Element
  • Sample Output
  • Program Explanation
  • Practice Exercise
  • Frequently Asked Questions
📚 In this tutorial, you will learn:
  • How to find the minimum or smallest element in an array
  • How to use a variable to keep track of the minimum value
  • How to compare elements in an array
  • Step-by-step explanation of the program
  • Practice exercises to test your understanding

Introduction

In this tutorial, we will learn how to write a C program to find the minimum or smallest element in an array.

Finding the minimum element in an array is a fundamental programming problem. It is used in many real-world applications, such as:

  • Finding the lowest score in a class
  • Finding the minimum temperature in weather data
  • Finding the smallest number in a list of sales figures
  • Finding the minimum value in sensor readings

💡 Key Point: To find the minimum element, we assume the first element is the smallest, then compare it with all other elements. If we find a smaller element, we update our minimum variable.

C Program to Find Minimum Element in Array

#include <stdio.h>

int main() {
    int n, i;
    int min;
    
    // Ask user for number of elements
    printf("Enter the number of elements: ");
    scanf("%d", &n);
    
    // Declare array of size n
    int arr[n];
    
    // Read elements into the array
    printf("Enter %d elements:\n", n);
    for(i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
    
    // Assume first element is the minimum
    min = arr[0];
    
    // Find minimum element
    for(i = 1; i < n; i++) {
        if(arr[i] < min) {
            min = arr[i];
        }
    }
    
    // Display the minimum element
    printf("\nMinimum element in the array: %d\n", min);
    
    return 0;
}

Sample Output

Enter the number of elements: 5
Enter 5 elements:
10 50 30 40 20

Minimum element in the array: 10

Another Example:

Enter the number of elements: 6
Enter 6 elements:
100 200 50 75 25 150

Minimum element in the array: 25

Program Explanation

Let's break down the code step by step:

  1. Include Header File: #include <stdio.h> includes the standard input/output library.
  2. Declare Variables:
    • int n; — stores the number of elements
    • int i; — loop counter
    • int min; — stores the minimum element
  3. Get User Input: Prompts the user to enter the number of elements and then reads them into the array.
  4. Initialize Minimum: min = arr[0]; assumes the first element is the smallest.
  5. Find Minimum: The for loop starts from i = 1 and compares each element with min:
    • If arr[i] < min, then update min = arr[i];
  6. Display Result: printf("\nMinimum element in the array: %d\n", min); prints the smallest element.
  7. Return: return 0; indicates successful program execution.

📝 Note: The algorithm works for both positive and negative numbers. For negative numbers, the smallest (most negative) will be found correctly.

Algorithm to Find Minimum Element

  1. Start
  2. Read the number of elements (n)
  3. Read n elements into the array
  4. Set min = arr[0]
  5. For i = 1 to n-1:
    • If arr[i] < min, set min = arr[i]
  6. Print min
  7. End

💻 Practice Exercise

Challenge 1: Modify the program to find both the maximum and minimum elements in the array in a single pass.

Challenge 2: Find the second smallest element in the array.

🔍 Click to Show Solution for Challenge 1
#include <stdio.h>

int main() {
    int n, i;
    int max, min;
    
    printf("Enter the number of elements: ");
    scanf("%d", &n);
    
    int arr[n];
    
    printf("Enter %d elements:\n", n);
    for(i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
    
    max = arr[0];
    min = arr[0];
    
    for(i = 1; i < n; i++) {
        if(arr[i] > max) {
            max = arr[i];
        }
        if(arr[i] < min) {
            min = arr[i];
        }
    }
    
    printf("\nMaximum element: %d\n", max);
    printf("Minimum element: %d\n", min);
    
    return 0;
}

Frequently Asked Questions

1. How do you find the minimum element in an array in C?

Assume the first element is the minimum, then compare it with all other elements using a loop. If you find a smaller element, update the minimum variable.

2. What if the array has only one element?

If the array has only one element, the loop doesn't run (since i = 1 and n = 1), and min correctly holds the only element.

3. Can I use this method with negative numbers?

Yes, the method works with any integers, including negative numbers. The algorithm correctly identifies the smallest (most negative) number.

4. What is the time complexity of this algorithm?

The time complexity is O(n), where n is the number of elements in the array. We need to visit each element once to find the minimum.

5. How is this different from finding the minimum using sorting?

Sorting the array would take O(n log n) time, while this method takes O(n) time. The direct comparison method is more efficient for finding just the minimum element.

💡 Tip: Always initialize the minimum variable with the first element of the array to avoid any assumptions about valid values.

📖 Related Tutorials

  • Sum of Array Elements
  • Find Maximum Element in Array
  • Calculate Average of Array Elements
  • Find Second Largest Element

Previous Topic: -->> Find Maximum Element in Array   ||   Next topic: -->> Calculate Average of Array Elements


📚 Explore More Topics

🗄️ SQL Interview Questions & Answers

SQL SELECT Statement FAQ SQL Restricting & Sorting Data FAQ SQL Group Functions & Aggregated Data FAQ SQL Multiple Tables (JOINs) FAQ SQL Subqueries FAQ SQL DML Statements (Managing Tables) FAQ SQL Indexes, Synonyms & Sequences FAQ SQL DDL (Tables & Relationships) FAQ SQL Views FAQ SQL Indexing Best Practices FAQ SQL Window & Analytic Functions FAQ

🐍 Python Interview Questions & Answers

Python Interview Questions Python Syntax & Variables FAQ Python Data Types FAQ Python If-Else FAQ Python Loops FAQ Python Functions Interview Q Python String Manipulation FAQ Python Lists & Dictionaries FAQ Python Tuples & Sets FAQ Python Exception Handling FAQ Python OOP Interview Questions

☕ Java Interview Questions & Answers

Java Introduction Interview Q Java Development Environment FAQ Java Data Types FAQ Java Control Flow & Operators FAQ Java Basic Input/Output FAQ Java Arrays FAQ Java Strings FAQ Java Methods FAQ Java Basic OOP Concepts FAQ Java Advanced OOP Concepts FAQ Java OOP Best Practices FAQ Java Exception Handling FAQ Java Synchronization FAQ Java Threads & Concurrency FAQ Java Collection Framework FAQ Java File I/O & Serialization FAQ Java Serialization & Deserialization FAQ Java Features FAQ Java Inner & Anonymous Classes FAQ Java Memory Management FAQ Java Packages FAQ Java Wrapper Classes FAQ Java Streams & Lambda FAQ

C Language

  • Home
  • Why C Language
  • History of C Language
  • Applications of C Language
  • Introduction To C
    • What is Program?
    • Structure of C Program
    • Working Of C Program
    • CHARACTER SET
    • VARIABLES AND IDENTIFIERS
    • BUILT-IN DATA TYPES
    • OPERATORS AND EXPRESSIONS
    • CONSTANTS AND LITERALS
    • SIMPLE ASSIGNMENT STATEMENT
    • BASIC INPUT/OUTPUT STATEMENT
    • SIMPLE 'C' PROGRAMS
    • Assignments
  • Operators in C Programming
    • Arithmetic Operators
    • Assignment Operators
    • Increment and Decrement Operators
    • Relational Operators
    • Logical Operators
    • Bitwise Operators
    • Other Operators
    • Assignments
  • Conditional Statements
    • DECISION MAKING WITHIN A PROGRAM
    • CONDITIONS
    • IF STATEMENT
    • IF-ELSE STATEMENT
    • IF-ELSE LADDER
    • NESTED IF-ELSE
    • SWITCH CASE
    • Assignments
  • Loops Statements
    • Introduction to Loops
    • GO TO Statement
    • Do while Loop
    • While Loop
    • Nested While Loop
    • Difference Between While and Do while
    • Difference Between Goto and loop
    • while loop assignments
    • C FOR Loop
    • C For loop examples
    • Nested for loop
    • Nested for loop examples
    • Infinite while Loops
    • Infinite for Loops
    • Continue in Loops
    • break in Loops
    • difference while do..while & for
    • Assignments
  • Arrays
    • One Dimensional Array
    • Declaring 1D Arrays
    • Initilization of 1D arrays
    • Accessing element of one 1D Array
    • Read and Display 1D Arrays
    • Two Dimensional Arrays
    • Declare 2D Arrays
    • Read and Display 2D Arrays
    • Assignments/Examples
  • Functions
    • Introduction
    • Need For User-Defined Function
    • Multiple Function Program
    • Modular Programming
    • Elements Of User Defined Function
    • Function Definition
    • Function Declaration
    • Types of functions
    • Nesting of Function
    • Recursion
    • Passing Array To Functions
    • Scope,Visibility and Lifetime of Variables
    • Assignments
  • Structure
    • Introduction
    • Array vs Structure
    • Defining Structure
    • Declaring Structure Variables
    • Type Defined Structure
    • Accessing Structure Members
    • Structure Initilization
    • Copying & Comparing Structure Variables
    • Array of Structure
    • Arrays Within Structure
    • Structures Within Structures
    • Structures and Functions
    • Structure Examples/Assignments
  • Union
    • Define Union
    • Create and use Union
    • Difference Between Structure and Union
    • Union Examples
    • Union FAQ
  • Pointers
    • What Are Pointers In C?
    • How Do We Use Pointers In C?
    • Declaration Of A Pointer
    • The Initialization Of A Pointer
    • Syntax Of Pointer Initialization
    • Use Of Pointers In C
    • The Pointer To An Array
    • The Pointer To A Function
    • The Pointer To A Structure
    • Types Of Pointers
    • The Null Pointer
    • The Void Pointer
    • The Wild Pointer
    • The Near Pointer
    • The Huge Pointer
    • The far Pointer
    • dangling pointer
    • Accessing Pointers- Indirectly And Directly
    • Pros Of Using Pointers In C
    • Cons Of Pointers In C
    • Applications Of Pointers In C
    • The & Address Of Operator In C
    • How To Read The Complex Pointers In C?
    • Practice Problems On Pointers
  • File Processing
    • File Handling In C
    • Types Of Files In C
    • Operations Done In File Handling
    • File Examples
    • Binary Files
    • count words,lines in a file
    • Copy files
    • Update File
    • count vowels in a file
  • Preprocessor
    • Macro substitution division
    • File Inclusion
    • Conditional Compilation
    • Other directives
    • Examples
  • Dynamic Memory Allocation
    • malloc
    • calloc
    • free
    • realloc
    • Examples
  • Storage Classes
  • Graphics
  • Frequently Asked Interview Questions (FAQ)
    • Introduction To C FAQ
    • Operators FAQ
    • Conditional Statements FAQ
    • Loops FAQ
    • Arrays FAQ
    • Function FAQ
    • Structure FAQ
    • Pointers FAQ
    • Files FAQ
    • Storage classes FAQ
    • Dynamic Memory FAQ
  • Programs/Assignments
    • Introduction To C
    • Operators
    • Conditional Statements
    • Loops
    • Arrays
    • Function
    • Structure
    • Pointers
    • Files
    • Storage classes
    • Dynamic Memory
  • Case Studies
  • Multiple Choice Questions
    • Introduction To C MCQ
    • Operators MCQ
    • Conditional Statements MCQ
    • Loops MCQ
    • Arrays MCQ
    • Function MCQ
    • Structure MCQ
    • Pointers MCQ
    • Files MCQ
    • Storage classes MCQ
    • Dynamic Memory MCQ
    • More MCQ

Get in touch

  • tech2dsm@gmail.com

© Sankalan Data Tech. All rights reserved.