M-13-NESTED-LOOP-AND-PATTERN

M-13-NESTED-LOOP-AND-PATTERN

• star pattern

• n = 4 means 4 lines of start .
• star pattern

#include <stdio.h>

int main()
{
    int n, star = 1;
    scanf("%d", &n);

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= star; j++)
        {
            printf("*");
        }
        printf("\n");
        star++;
    }
    return 0;
}

• reverse star pattern

#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);

    int star = n;

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= star; j++)
        {
            printf("*");
        }
        printf("\n");
        star--;
    }
    return 0;
}

• pyramid pattern

#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);
    int star = 1;
    int space = n - 1;
    // printing line 
    for(int i =1; i<=n; i++){

        // printing space 

        for(int j =1; j<= space; j++){
            printf(" ");
        }
        // printing star
        for(int j =1; j<=star; j++){
            printf("*");
        }
        printf("\n");
        star+=2;
        space--;
    }
    return 0;
}

• pattern with number

#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);
    int val = 1;
    int space = n - 1;
    // printing line 
    for(int i =1; i<=n; i++){

        // printing space 

        for(int j =1; j<= space; j++){
            printf(" ");
        }
        // printing number
        for(int j =1; j<=val; j++){
            printf("%d", val);
        }
        printf("\n");
        val++;
        space--;
    }
    return 0;
}

• sum of two value equal x and usage of flag

#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);
    int a[n];
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    int x;
    scanf("%d", &x);
    //  flag variable 
    int flag = 0;
    
    // Check for pairs that sum up to x
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            if (a[i] + a[j] == x)
            {
                flag = 1; // Set flag to indicate a pair is found
                printf("Pair found: %d and %d\n", a[i], a[j]);
            }
        }
    }
    if (flag == 0)
    {
        printf("No pair found that sums up to %d\n", x);
    }
    return 0;
}

• selection sort

#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);
    int a[n];
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    
    // Check for pairs that sum up to x
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            if (a[i] > a[j])
            {
                // Swap elements
                int temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }
    }
    printf("Sorted array in ascending order:\n");
    for (int i = 0; i < n; i++)
    {
        printf("%d ", a[i]);
    }
    return 0;
}

#include <stdio.h>

int main()
{
    int n, star = 1;
    scanf("%d", &n);
    int space = n - 1;

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= space; j++)
        {
            printf(" ");
        }
        for (int j = 1; j <= star; j++)
        {
            printf("* ");
        }
        printf("\n");
        star++;
        space--;
    }
    return 0;
}

#include <stdio.h>

int main()
{
    int n, star = 1;
    scanf("%d", &n);
    int space = n - 1;

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= space; j++)
        {
            printf(" ");
        }
        for (int j = 1; j <= star; j++)
        {
            printf("%d ", i);
        }
        printf("\n");
        star++;
        space--;
    }
    return 0;
}

#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);

    int star = n;  // Now n has a value, so we can assign it to star
    int space = 0;

    for (int i = 1; i <= n; i++)
    {
        // Print leading spaces
        for (int j = 1; j <= space; j++)
        {
            printf(" ");
        }

        // Print stars
        // We want to print 'star' number of stars, so j goes from 1 up to star
        for (int j = 1; j <= star; j++)
        {
            printf("*");
        }

        printf("\n");
        star--;  // Decrease stars for the next row
        space++; // Increase spaces for the next row
    }

    return 0;
}

#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);

    int star = 1;
    int space = n - 1;

    for (int i = 1; i <= n; i++)
    {
        // Print leading spaces
        for (int j = 1; j <= space; j++)
        {
            printf(" ");
        }

        // Print characters
        for (int j = 1; j <= star; j++)
        {
            // 'A' + 0 = A, 'A' + 1 = B, etc.
            printf("%c ", 'A' + i - 1);
        }

        printf("\n");
        star++;
        space--;
    }
    return 0;
}