In this program, we use numbers to generate a pyramid-like pattern. And numbers follow a pattern similar to this: 1 in the first line, 121 in the second line, 12321 in the third line, and so on.
Program code:
#include <iostream>
using namespace std;
void pattern(int n)
{ int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n-i;j++)
{
cout<<" ";
}
for(j=1;j<=i;j++)
{
cout<<j;
}
for(j=i-1;j>=1;j--)
{
cout<<j;
}
cout<<"\n";
}
}
// Driver Function
int main()
{
int n = 5;
pattern(n);
return 0;
}
1
121
12321
1234321
123454321
Note: also read about Pattern Program Using Star
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…