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

Mirrored Right Triangle Star Pattern

Read summary with AI tools

The right triangle flipped so that the right angle is on the right. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.

Quick answer: Use an outer loop for the rows, i = 1 to n. On row i, print n − i spaces first and then i stars, then a new line. The spaces push the stars to the right, so the triangle leans against the right edge. For n = 5 the first row is 4 spaces and 1 star.

This program is part of the Star Patterns collection.

Table of contents8 sections
  1. Output
  2. How the mirrored right triangle star pattern works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity
  8. Frequently asked questions

Mirrored Right Triangle Star Pattern output

Output (n = 5):

    *
   **
  ***
 ****
*****
Mirrored Right Triangle Star Pattern layout diagram, row by row (n = 5)
How each row of the mirrored right triangle star pattern is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the mirrored right triangle star pattern works

Before the i stars, print n − i spaces so every row ends in the same column.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Print n − i spaces.
  3. Print i stars.
  4. Move to the next line.

Key takeaways

  • Every row is exactly n characters wide: n − i spaces plus i stars.
  • The stars are the same as in the right triangle; only the leading spaces are new.
  • The spaces go down by one and the stars go up by one on each row.
  • Spaces after the stars change nothing; only the spaces before the stars move the shape.

Mirrored Right Triangle Star Pattern in C

#include <stdio.h>

int main(void) {
    int n = 5;

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

Mirrored Right Triangle Star Pattern in C++

#include <iostream>
using namespace std;

int main() {
    int n = 5;

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

Mirrored Right Triangle Star Pattern in Java

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

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

Mirrored Right Triangle Star Pattern in Python

n = 5

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

Frequently asked questions

Why is the triangle aligned to the right?

Each row prints n − i spaces before its i stars, and (n − i) + i = n. So every row ends in column n, and that shared end column forms the straight right edge.

How do I make it hollow?

Print a star only on the edges and a space inside. The hollow mirrored right triangle star pattern shows the condition.

How do I turn it upside down?

Loop i from n down to 1 and keep the same formulas. See the inverted mirrored right triangle star pattern.

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.