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);
}
Enter row count: 7
1
212
32123
4321234
32123
212
1
Note: also read about Floyd’s Triangle
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
Staying up to the mark is what defines me. Hi all! I’m Rabecca Fatima a keen learner, great enthusiast, ready to take new challenges as stepping stones towards flying colors.
Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…
Given an integer A. Compute and return the square root of A. If A is…
Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…
A heap is a specialized tree-based data structure that satisfies the heap property. It is…
What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…