Skip to main content

Featured

Merge Sort in C++

  Merge Sort in C++ Introduction Merge Sort is a popular sorting algorithm that follows the Divide and Conquer approach. It divides an array into smaller subarrays, recursively sorts those subarrays, and finally merges the sorted subarrays to produce a completely sorted array. In this tutorial, we will learn how to implement Merge Sort in C++ . The program divides the array into two halves using the mid index, recursively sorts both halves, and then combines them using the merge() function. Merge Sort has a time complexity of O(n log n) in the best, average, and worst cases. Table of Contents Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Keywords Conclusion Algorithm Start the program. Read the size of the array. Read the array elements from the user. Call the mer...
Post a Comment
Read more
Labels

C Program to Find the Smallest Element in an Array

🔍 C Program to Find the Smallest Element in an Array

#include<stdio.h>
int main( )
{
    int num, a[100];
    printf("Enter the size of the array:\n");
    scanf("%d", &num);

    if(num <= 0)
    {
        printf("Invalid array size");
        return 1;
    }

    printf("Enter %d elements into the array:\n", num);
    for(int i = 0; i < num; i++)
    {
        scanf("%d", &a[i]);
    }

    int min = a[0]; // Start by assuming first element is smallest

    for(int i = 1; i < num; i++) // Start from 1 to avoid rechecking a[0]
    {
        if(a[i] < min)
        {
            min = a[i];
        }
    }

    printf("The smallest element in the array is %d\n", min);

    return 0;
}

📝 Explanation:

This C program reads an array of integers from the user and finds the smallest element by comparing each item with a `min` variable initialized to the first element.

💡 Sample Output:

Enter the size of the array:
5
Enter 5 elements into the array:
12 5 9 30 2
The smallest element in the array is 2

🔍 Keywords:

Smallest number in array C program, find minimum element, array comparison logic, beginner C programs, interview C questions

Labels:

Comments

Post a Comment

Popular Posts

🌙