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.
This program is part of the Star Patterns collection.
Mirrored Rhombus Star Pattern output
Output (n = 5):
*****
*****
*****
*****
*****
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.
- Run the outer loop for
ifrom1ton, one row per pass. - Print
i − 1spaces. - Print
nstars. - Move to the next line.
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).





