Skip to main content

Featured

C Program to Solve Two Sum Using Brute Force (With Algorithm & Output)

 Introduction The Two Sum problem is a popular coding interview question where we must find two indices of an array whose values add up to a given target. This program demonstrates a simple brute-force solution in C using nested loops and dynamic memory allocation. Problem Statement Given an integer array and a target value, return the indices of the two numbers such that they add up to the target. Each input has exactly one solution, and the same element cannot be used twice. The result should return the indices, not the values. If no solution exists, return NULL.  Algorithm / Logic Explanation Start the program. Traverse the array using a loop from index 0 to numsSize - 1 . Inside this loop, use another loop starting from i + 1 to numsSize - 1 . For every pair (i, j) , check if nums[i] + nums[j] == target . If condition becomes true: Allocate memory for 2 integers using malloc() . Store indices i and j . Set returnSize = 2 . Return the result poi...
Post a Comment
Read more
Labels

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
Labels:

Comments

Post a Comment

Popular Posts

🌙