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

Linear Search in an Array - C Program

Linear Search in Array - C Program

✅ Linear Search in an Array - C Program

#include <stdio.h>

int main() {
    int size, key, found = 0;

    // Input the size of the array
    printf("Enter the size of the array:\n");
    scanf("%d", &size);

    if (size <= 0) {
        printf("Invalid array size!\n");
        return 1;
    }

    int arr[size];

    // Input array elements
    printf("Enter %d elements:\n", size);
    for (int i = 0; i < size; i++) {
        scanf("%d", &arr[i]);
    }

    // Input the element to search
    printf("Enter the element to search:\n");
    scanf("%d", &key);

    // Search for the element
    for (int i = 0; i < size; i++) {
        if (arr[i] == key) {
            printf("Element %d found at index %d (position %d)\n", key, i, i + 1);
            found = 1;
            break;
        }
    }

    if (!found) {
        printf("Element %d not found in the array.\n", key);
    }

    return 0;
}

📘 Explanation:

This program demonstrates a simple linear search in an array. It takes the array size and elements from the user, along with the target value to search. It then loops through the array and checks for equality with the given key. If found, it prints the index and position. If the element is not present, it informs the user accordingly. The `break` statement is used to stop at the first occurrence.

🧾 Sample Output:

Enter the size of the array:
5
Enter 5 elements:
10 20 30 40 50
Enter the element to search:
30
Element 30 found at index 2 (position 3)

🔑 Keywords:

Array Search in C, Linear Search Program, Find Index of Element, C Array Program, Beginner C Code, Searching in Arrays

📌 Hashtags:

#CProgramming #ArraySearch #LinearSearch #BeginnerC #CCodeWithExplanation #DataSearch

Labels:

Comments

Post a Comment

Popular Posts

🌙