The right triangle upside down: n stars first, one fewer 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 Star Patterns collection.
Inverted Right Triangle Star Pattern output
Output (n = 5):
***** **** *** ** *

How the inverted right triangle star pattern works
Same inner loop as the 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
istars. - Move to the next line.
Inverted Right Triangle Star Pattern 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("*");
printf("\n");
}
return 0;
}Inverted Right Triangle Star Pattern 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 << "*";
cout << endl;
}
return 0;
}Inverted Right Triangle Star Pattern in Java
public class InvertedRightTriangleStar {
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("*");
System.out.println();
}
}
}Inverted Right Triangle Star Pattern in Python
n = 5
for i in range(n, 0, -1):
for j in range(1, i + 1):
print("*", 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).





