New: 77 pattern programs with tested code in C, C++, Java and Python Explore patterns

Palindrome Number Pyramid

Read summary with AI tools
Table of contents
  1. Output
  2. How the palindrome number pyramid works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity
  8. Related patterns

Each row counts up to i and back down to 1, so every row reads the same forwards and backwards. The logic is explained step by step, and the full program is given in C, C++, Java and Python.

This program is part of the Pyramid Patterns collection.

Palindrome Number Pyramid output

Output (n = 5):

    1
   121
  12321
 1234321
123454321
Palindrome Number Pyramid layout diagram, row by row (n = 5)
How each row of the palindrome number pyramid is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the palindrome number pyramid works

After the leading spaces, the first inner loop prints 1 up to i. A second loop prints i − 1 down to 1 by using i − j.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Print n − i spaces.
  3. Print i numbers (value j).
  4. Print i − 1 numbers (value i − j).
  5. Move to the next line.

Palindrome Number Pyramid 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);
        for (int j = 1; j <= i - 1; j++)
            printf("%d", i - j);
        printf("\n");
    }
    return 0;
}

Palindrome Number Pyramid 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;
        for (int j = 1; j <= i - 1; j++)
            cout << i - j;
        cout << endl;
    }
    return 0;
}

Palindrome Number Pyramid in Java

public class PalindromeNumberPyramid {
    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);
            for (int j = 1; j <= i - 1; j++)
                System.out.print(i - j);
            System.out.println();
        }
    }
}

Palindrome Number Pyramid 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="")
    for j in range(1, i):
        print(i - 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).

Authored by

Ghanendra Yadav runs Pattern Programs from Bangalore, India. The site started in 2020 to help students practise loops and logic through pattern programs in C, C++, Java and Python. Every program published here is compiled and run before it goes live, and the output shown is the real output.

Latest articles

Leave a comment

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.