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

Merge Two Sorted Arrays - C Program

Merge Two Sorted Arrays - C Program

🔀 Merge Two Sorted Arrays (C Program)

#include <stdio.h>

int main() {
    int size1, size2;

    // Read size1
    printf("Enter a size1: ");
    scanf("%d", &size1);
    int a1[size1];

    printf("Enter array1 elements: ");
    for (int i = 0; i < size1; i++) {
        scanf("%d", &a1[i]);
    }

    // Read size2
    printf("Enter a size2: ");
    scanf("%d", &size2);
    int a2[size2];

    printf("Enter array2 elements: ");
    for (int i = 0; i < size2; i++) {
        scanf("%d", &a2[i]);
    }

    int merged[size1 + size2];
    int i = 0, j = 0, k = 0;

    // Merge two sorted arrays
    while (i < size1 && j < size2) {
        if (a1[i] < a2[j])
            merged[k++] = a1[i++];
        else
            merged[k++] = a2[j++];
    }

    // Copy remaining elements
    while (i < size1)
        merged[k++] = a1[i++];

    while (j < size2)
        merged[k++] = a2[j++];

    // Print merged array
    printf("Merged array: ");
    for (int m = 0; m < k; m++) {
        printf("%d ", merged[m]);
    }
    printf("\n");

    return 0;
}

📘 Explanation:

🔹 This program takes two sorted arrays as input from the user.
🔹 It merges them into a single sorted array using the two-pointer technique.
🔹 Remaining elements from either array are added at the end.
🔹 The final merged array is printed in sorted order.

🧪 Sample Output:

Enter a size1: 5
Enter array1 elements: 1 3 5 7 9
Enter a size2: 4
Enter array2 elements: 2 4 6 8
Merged array: 1 2 3 4 5 6 7 8 9

🏷️ Keywords:

C program merge arrays, sorted array merging, combine two sorted arrays, two-pointer technique C, array manipulation in C

Labels:

Comments

Post a Comment

Popular Posts

🌙