A centred pyramid where row i counts from 1 to i. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.
This program is part of the Pyramid Patterns collection.
Number Pyramid Pattern output
Output (n = 5):
1 1 2 1 2 3 1 2 3 4 1 2 3 4 5

How the number pyramid pattern works
Print n − i spaces, then the numbers 1 to i, each followed by a space. The trailing space after each number is what makes the rows line up as a pyramid.
- Run the outer loop for
ifrom1ton, one row per pass. - Print
n − ispaces. - Print
inumbers (valuej). - Move to the next line.
Number Pyramid Pattern in C
#include <stdio.h>
int main(void) {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
printf(" ");
for (int j = 1; j <= i; j++)
printf("%d ", j);
printf("\n");
}
return 0;
}Number Pyramid Pattern in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
cout << " ";
for (int j = 1; j <= i; j++)
cout << j << " ";
cout << endl;
}
return 0;
}Number Pyramid Pattern in Java
public class NumberPyramid {
public static void main(String[] args) {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
System.out.print(" ");
for (int j = 1; j <= i; j++)
System.out.print(j + " ");
System.out.println();
}
}
}Number Pyramid Pattern in Python
n = 5
for i in range(1, n + 1):
for j in range(1, n - i + 1):
print(" ", end="")
for j in range(1, i + 1):
print(j, end=" ")
print()Time and space complexity
The program prints one character for each position in the pattern, so for n rows it runs in O(n²) time. It only needs a few loop variables, so the extra memory is O(1).





