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 Sort an Array in Ascending Order (Bubble Sort)

🔢 C Program to Sort an Array in Ascending Order (Bubble Sort)

#include<stdio.h>
int main()
{
    int num;
    printf("Enter Size of the array:\n");
    scanf("%d", &num);
    if(num <= 0)
    {
        printf("!Invalid array size:\n");
        return 1;
    }
    int a[num];
    printf("Enter %d elements in an array:\n", num);
    for(int i = 0; i < num; i++)
    {
        scanf("%d", &a[i]);
    }

    printf("Array elements before ascending order:\n");
    for(int i = 0; i < num; i++)
    {
        printf("%d ", a[i]);
    }

    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;
            }
        }
    }

    printf("\nArray elements after ascending order:\n");
    for(int i = 0; i < num; i++)
    {
        printf("%d ", a[i]);
    }
}

📝 Explanation:

This C program reads an array of integers, displays it before sorting, then sorts it in ascending order using Bubble Sort algorithm, and displays the sorted array.

💡 Sample Output:

Enter Size of the array:
5
Enter 5 elements in an array:
34 12 78 9 50
Array elements before ascending order:
34 12 78 9 50
Array elements after ascending order:
9 12 34 50 78

🔍 Keywords:

Bubble Sort in C, ascending order array C program, sorting integers, C beginner programs, array logic

Labels:

Comments

Post a Comment

Popular Posts

🌙