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
Reverse Number Triangle output
Output (n = 5):
5 54 543 5432 54321

How the reverse number triangle works
Instead of j, print n − j + 1, which runs n, n − 1, n − 2 … as j increases.
- Run the outer loop for
ifrom1ton, one row per pass. - Print
inumbers (valuen − j + 1). - 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).









