12345 first, then one digit shorter on each row. This tutorial shows the output, a row-by-row diagram and the complete program in C, C++, Java and Python.
This program is part of the Number Patterns collection.
Table of contents7 sections
Inverted Number Triangle output
Output (n = 5):
12345 1234 123 12 1

How the inverted number triangle works
The number right triangle with the outer loop counting i down from n to 1.
- Run the outer loop for
ifromndown to1, one row per pass. - Print
inumbers (valuej). - Move to the next line.
Inverted Number Triangle in C
#include <stdio.h>
int main(void) {
int n = 5;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= i; j++)
printf("%d", j);
printf("\n");
}
return 0;
}Inverted Number Triangle in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= i; j++)
cout << j;
cout << endl;
}
return 0;
}Inverted Number Triangle in Java
public class InvertedNumberTriangle {
public static void main(String[] args) {
int n = 5;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= i; j++)
System.out.print(j);
System.out.println();
}
}
}Inverted Number Triangle in Python
n = 5
for i in range(n, 0, -1):
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).









