A slanted square (parallelogram) of stars. 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.
Rhombus Star Pattern output
Output (n = 5):
***** ***** ***** ***** *****

How the rhombus star pattern works
Every row has the same n stars; only the leading spaces change, n − i on row i, which slants the shape.
- Run the outer loop for
ifrom1ton, one row per pass. - Print
n − ispaces. - Print
nstars. - Move to the next line.
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 <= n - i; j++)
printf(" ");
for (int j = 1; j <= n; j++)
printf("*");
printf("\n");
}
return 0;
}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 <= n - i; j++)
cout << " ";
for (int j = 1; j <= n; j++)
cout << "*";
cout << endl;
}
return 0;
}Rhombus Star Pattern in Java
public class RhombusStar {
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 <= n; j++)
System.out.print("*");
System.out.println();
}
}
}Rhombus 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, 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).





