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...
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

🌙