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 largest element in an array using bubble sort

Largest Element in Array - C Program

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

#include <stdio.h>

void largestElement(int a[], int num)
{
    // Bubble sort 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 largest element is at index num - 1
    printf("Largest element in the array: %d\n", a[num - 1]);
}

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

    if(num < 1)
    {
        printf("Invalid! Need at least 1 number to find the 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]);
    }

    largestElement(a, num);
    return 0;
}
  

๐Ÿ“˜ Explanation:

  • Reads the array size and elements from the user.
  • Sorts the array using Bubble Sort in ascending order.
  • The largest element will be at the last index (num - 1) after sorting.
  • If size is less than 1, it gives an error message.

๐Ÿงช Sample Output:

Enter the size of the array:
5
Enter 5 elements:
10 45 3 89 27
Largest element in the array: 89
    

๐Ÿท️ Keywords:

largest number in array, C program for max element, bubble sort, array processing in C, beginner C logic, find max in array

Comments

Popular Posts

๐ŸŒ™