Skip to main content

Featured

C Program to Check Prime Number Using Efficient Logic

  Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design.  Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

C program to find the second largest element in an array using simple iteration

Second Largest Element in Array - C Program

๐Ÿ” Find Second Largest Element in Array (C Program)

#include<stdio.h>

int main()
{
    int num, a[100];
    printf("Enter the size of the array:\n");
    scanf("%d", &num);

    if (num < 2)
    {
        printf("Invalid input! At least two elements are required to find the second largest element.\n");
        return 1;
    }

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

    int first, second;

    if (a[0] > a[1])
    {
        first = a[0];
        second = a[1];
    }
    else
    {
        first = a[1];
        second = a[0];
    }

    for (int i = 2; i < num; i++)
    {
        if (a[i] > first)
        {
            second = first;
            first = a[i];
        }
        else if (a[i] > second && a[i] != first)
        {
            second = a[i];
        }
    }

    if (first == second)
    {
        printf("All elements are equal.\n");
    }
    else
    {
        printf("The second largest element in the array is %d\n", second);
    }

    return 0;
}
  

๐Ÿ“˜ Explanation:

๐Ÿ”น The program accepts the size and values of an array.
๐Ÿ”น It compares the first two elements to initialize `first` and `second`.
๐Ÿ”น Then, for the rest of the array, it updates these values accordingly:
    – If a new maximum is found, the old maximum becomes second.
    – If it's between first and second and not equal to first, update second.
๐Ÿ”น If all elements are the same, a message is displayed.

๐Ÿงช Sample Output:

Enter the size of the array:
6
Enter 6 elements:
21 45 78 64 90 55
The second largest element in the array is 78
    

๐Ÿท️ Keywords:

second largest element in array C, C array comparison, beginner C program, max two values in array, C programming array logic

Comments

Popular Posts

๐ŸŒ™