Categories: C++

Diamond Pattern Using Numbers

Program code:

#include<iostream>
using namespace std;

void display(int n)
{
    int space = n / 2, num= 1;

    for (int i = 1; i <= n; i++)
    {

        for (int j = 1; j <= space; j++)
            cout << " ";

        int count = num/ 2 + 1;
        for (int k = 1; k <= num ; k++)
        {
            cout << count;
            if (k <= num/ 2)
                count--;
            else
                count++;
        }

        cout << endl;
        if (i <= n / 2)
        {
            space= space- 1;
            num= num+ 2;
        }

        else
        {
            space= space+ 1;
            num= num- 2;
        }
    }
}

int main()
{
    int n; 
    cout << "Enter row count: ";
    cin >> n;
    cout << endl;
    display(n);
}
Output:
Enter row count: 7
   1
  212
 32123
4321234
 32123
  212
   1

Note: also read about Floyd’s Triangle

Follow Me

Please follow me to read my latest post on programming and technology if you like my post.

https://www.instagram.com/coderz.py/

https://www.facebook.com/coderz.py

Share
Published by
Rabecca Fatima

Recent Posts

Generate Parenthesis | Intuition + Code | Recursion Tree | Backtracking | Java

Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…

3 months ago

Square Root of Integer

Given an integer A. Compute and return the square root of A. If A is…

1 year ago

Build Array From Permutation

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…

1 year ago

DSA: Heap

A heap is a specialized tree-based data structure that satisfies the heap property. It is…

2 years ago

DSA: Trie

What is a Trie in DSA? A trie, often known as a prefix tree, is…

2 years ago

Trees: Lowest Common Ancestor

What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…

2 years ago