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

Mirrored Rhombus Star Pattern

Read summary with AI tools

A rhombus that leans to the right instead of the left. The logic is explained step by step, and the full program is given in C, C++, Java and Python.

Quick answer: Loop over the rows from i = 1 to n. On row i, print i − 1 spaces and then n stars. The first row starts at the left edge and each row starts one step further right, so the block leans to the right.

This program is part of the Star Patterns collection.

Table of contents8 sections
  1. Output
  2. How the mirrored rhombus 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 Rhombus Star Pattern output

Output (n = 5):

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

How the mirrored rhombus star pattern works

Row i starts with i − 1 spaces, so each row moves one step to the right. Every row prints the same n stars.

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

Key takeaways

  • It is the rhombus star pattern with the space count reversed: i − 1 instead of n − i.
  • The spaces grow by one per row, so the rows move right as you go down.
  • Each row still has exactly n stars.
  • The first row has no spaces, because i − 1 = 0 when i = 1.

Mirrored Rhombus 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 <= i - 1; j++)
            printf(" ");
        for (int j = 1; j <= n; j++)
            printf("*");
        printf("\n");
    }
    return 0;
}

Mirrored Rhombus 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 <= i - 1; j++)
            cout << " ";
        for (int j = 1; j <= n; j++)
            cout << "*";
        cout << endl;
    }
    return 0;
}

Mirrored Rhombus Star Pattern in Java

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

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

Mirrored Rhombus Star Pattern in Python

n = 5

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

With i spaces the first row would already be indented by one. Starting from i − 1 keeps the first row at the left edge.

How do I make it hollow?

Keep the same shape but print stars only on the border. See the hollow mirrored rhombus star pattern.

How do I slant it to the left?

Print n − i spaces instead. That gives the rhombus 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.