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 bubble sort

Second Largest Element in Array - C Program

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

#include <stdio.h>

void secondLargest(int a[], int num)
{
    // Bubble sort the array in ascending order
    for(int i = 0; i < num - 1; i++)
    {
        for(int j = 0; j < num - i - 1; j++)
        {
            if(a[j] > a[j+1])
            {
                int temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
            }
        }
    }

    // After sorting, the second largest element will be at index num-2
    printf("Second largest element in the array: %d\n", a[num - 2]);
}

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

    if(num < 2)
    {
        printf("Invalid! Need at least 2 numbers to find the second largest element.\n");
        return 1;
    }

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

    secondLargest(a, num);
    return 0;
}
  

๐Ÿ“˜ Explanation:

  • Reads the size and elements of the array.
  • Sorts the array using Bubble Sort in ascending order.
  • The second largest number will be at index num - 2 after sorting.
  • Checks for at least 2 elements as a requirement.

๐Ÿงช Sample Output:

Enter the size of the array:
5
Enter 5 elements:
3 8 2 7 4
Second largest element in the array: 7
    

๐Ÿท️ Keywords:

second largest in C, array sorting, C program for array, bubble sort, C beginner exercise, top two elements

Comments

Popular Posts

๐ŸŒ™