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

Reverse Number Triangle (5, 54, 543)

Read summary with AI tools

Each row counts down from n. 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 Number Patterns collection.

Table of contents7 sections
  1. Reverse Number Triangle output
  2. How the reverse number triangle works
  3. Reverse Number Triangle in C
  4. Reverse Number Triangle in C++
  5. Reverse Number Triangle in Java
  6. Reverse Number Triangle in Python
  7. Time and space complexity

Reverse Number Triangle output

Output (n = 5):

5
54
543
5432
54321
Reverse Number Triangle layout diagram, row by row (n = 5)
How each row of the reverse number triangle is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the reverse number triangle works

Instead of j, print n − j + 1, which runs n, n − 1, n − 2 … as j increases.

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

Reverse Number Triangle in C

#include <stdio.h>

int main(void) {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            printf("%d", n - j + 1);
        printf("\n");
    }
    return 0;
}

Reverse Number Triangle in C++

#include <iostream>
using namespace std;

int main() {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            cout << n - j + 1;
        cout << endl;
    }
    return 0;
}

Reverse Number Triangle in Java

public class ReverseNumberTriangle {
    public static void main(String[] args) {
        int n = 5;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++)
                System.out.print(n - j + 1);
            System.out.println();
        }
    }
}

Reverse Number Triangle in Python

n = 5

for i in range(1, n + 1):
    for j in range(1, i + 1):
        print(n - j + 1, 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.