A rhombus that leans the other way, with only its outline printed. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.
This program is part of the Star Patterns collection.
Hollow Mirrored Rhombus Star Pattern output
Output (n = 5):
*****
* *
* *
* *
*****
How the hollow mirrored rhombus star pattern works
Row i starts with i − 1 spaces, so its stars run from column i to i + n − 1. Print a star on the first and last rows and at those two edge columns.
- Run the outer loop for
ifrom1ton, one row per pass. - Go through
i − 1 + npositions in the row. Print stars wherej ≥ i and (i = 1 or i = n or j = i or j = i + n − 1); print spaces everywhere else. - Move to the next line.
Hollow 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 + n; j++) {
if (j >= i && (i == 1 || i == n || j == i || j == i + n - 1))
printf("*");
else
printf(" ");
}
printf("\n");
}
return 0;
}Hollow 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 + n; j++) {
if (j >= i && (i == 1 || i == n || j == i || j == i + n - 1))
cout << "*";
else
cout << " ";
}
cout << endl;
}
return 0;
}Hollow Mirrored Rhombus Star Pattern in Java
public class HollowMirroredRhombusStar {
public static void main(String[] args) {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i - 1 + n; j++) {
if (j >= i && (i == 1 || i == n || j == i || j == i + n - 1))
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
}
}Hollow Mirrored Rhombus Star Pattern in Python
n = 5
for i in range(1, n + 1):
for j in range(1, i - 1 + n + 1):
if j >= i and (i == 1 or i == n or j == i or j == i + n - 1):
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).





