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

Smallest Element in Array - C Program

🔹 Find Smallest Element in Array (C Program)

#include <stdio.h>

void smallest(int a[], int num)
{
    // Sort array in ascending order using Bubble Sort
    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;
            }
        }
    }

    // The smallest element will be at index 0
    printf("Smallest element in the array: %d\n", a[0]);
}

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 smallest element.\n");
        return 1;
    }

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

    smallest(a, num);
    return 0;
}

📘 Explanation:

  • Takes input for size and elements of the array.
  • Uses Bubble Sort to sort the array in ascending order.
  • After sorting, the smallest element will be at index 0.
  • Handles invalid input if less than 1 element is entered.

🧪 Sample Output:

Enter the size of the array:
4
Enter 4 elements:
22 7 13 9
Smallest element in the array: 7

🏷️ Keywords:

smallest element in C, bubble sort program, C beginner programs, array minimum, array sort example, basic C logic
Labels:

Comments

Post a Comment

Popular Posts

🌙