Skip to main content

Featured

C Program to Check Prime Number Using Efficient Logic

  Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design.  Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

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

Comments

Popular Posts

๐ŸŒ™