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...

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

๐ŸŒ™