The outline of the inverted mirrored right triangle. 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.
Hollow Inverted Mirrored Right Triangle Star Pattern output
Output (n = 5):
*****
* *
* *
**
*
How the hollow inverted mirrored right triangle star pattern works
The hollow mirrored condition with i counting down from n.
- Run the outer loop for
ifromndown to1, one row per pass. - Go through
npositions in the row. Print stars wherej = n or j = n − i + 1 or i = n; print spaces everywhere else. - Move to the next line.
Hollow Inverted Mirrored 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 <= n; j++) {
if (j == n || j == n - i + 1 || i == n)
printf("*");
else
printf(" ");
}
printf("\n");
}
return 0;
}Hollow Inverted Mirrored 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 <= n; j++) {
if (j == n || j == n - i + 1 || i == n)
cout << "*";
else
cout << " ";
}
cout << endl;
}
return 0;
}Hollow Inverted Mirrored Right Triangle Star Pattern in Java
public class HollowInvertedMirroredRightTriangleStar {
public static void main(String[] args) {
int n = 5;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= n; j++) {
if (j == n || j == n - i + 1 || i == n)
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
}
}Hollow Inverted Mirrored Right Triangle Star Pattern in Python
n = 5
for i in range(n, 0, -1):
for j in range(1, n + 1):
if j == n or j == n - i + 1 or i == n:
print("*", end="")
else:
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).





