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

🌙