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

Double Diamond Star Pattern in C

Diamond Star Pattern in C

Diamond Star Pattern in C

This program prints a diamond shaped star pattern using nested loops and conditional statements in C.

๐Ÿ” C Program Code:

#include <stdio.h>

int main() {
    int num;
    printf("Enter the number:\n");
    scanf("%d", &num);

    // Upper part of diamond
    for(int i = 0; i < num; i++) {
        for(int j = 0; j < (2 * num); j++) {
            if(i + j <= num - 1) {
                printf("*");
            } else {
                printf(" ");
            }
            if(i + num <= j) {
                printf("*");
            } else {
                printf(" ");
            }
        }
        printf("\n");
    }

    // Lower part of diamond
    for(int i = 0; i < num; i++) {
        for(int j = 0; j < (2 * num); j++) {
            if(i >= j) {
                printf("*");
            } else {
                printf(" ");
            }
            if(i >= ((2 * num) - 1) - j) {
                printf("*");
            } else {
                printf(" ");
            }
        }
        printf("\n");
    }

    return 0;
}

๐Ÿ“Œ How It Works:

  • The program takes an integer input num which controls the size of the diamond.
  • The first pair of nested loops prints the upper half of the diamond:
    • Stars are printed on the left and right edges based on the conditions i + j <= num - 1 and i + num <= j.
    • Spaces fill the middle region, creating a hollow diamond shape.
  • The second pair of nested loops prints the lower half of the diamond:
    • Stars print based on conditions i >= j and i >= (2*num - 1) - j forming the symmetrical bottom.
  • Together, these loops form a complete diamond star pattern.

๐Ÿ’ป Sample Output for num=7:

* * * * * * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *
* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * * * * * *

Double Diamond Star Pattern in C

Double Diamond Star Pattern in C

This program prints a double diamond pattern of stars using nested loops in C.

๐Ÿ” C Program Code:

#include <stdio.h>

int main() {
    int n;
    printf("Enter the number:\n");
    scanf("%d", &n);

    // Upper part of pattern
    for (int i = 0; i < n; i++) {
        // Left stars
        for (int j = 0; j < n - i; j++) {
            printf("* ");
        }
        // Spaces in middle
        for (int j = 0; j < 2 * i; j++) {
            printf("  ");
        }
        // Right stars
        for (int j = 0; j < n - i; j++) {
            printf("* ");
        }
        printf("\n");
    }

    // Lower part of pattern
    for (int i = 0; i < n; i++) {
        // Left stars
        for (int j = 0; j <= i; j++) {
            printf("* ");
        }
        // Spaces in middle
        for (int j = 0; j < 2 * (n - i - 1); j++) {
            printf("  ");
        }
        // Right stars
        for (int j = 0; j <= i; j++) {
            printf("* ");
        }
        printf("\n");
    }

    return 0;
}

๐Ÿ“Œ How It Works:

  • The first for loop prints the upper half of the double diamond.
  • It prints decreasing stars on the sides and increasing spaces in the center.
  • The second for loop prints the lower half with increasing stars on the sides and decreasing spaces in the center.
  • This creates a symmetric double diamond star pattern.

๐Ÿ’ป Sample Output for n=7:

* * * * * * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *
* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * * * * * *

Comments

Popular Posts

๐ŸŒ™