A full pyramid followed by an inverted pyramid, which together make a diamond. This tutorial shows the output, a row-by-row diagram and the complete program in C, C++, Java and Python.
This program is part of the Pyramid Patterns collection.
Diamond Star Pattern output
Output (n = 5):
*
***
*****
*******
*********
*******
*****
***
*
How the diamond star pattern works
The first loop prints the upper half exactly like the full pyramid. The second loop runs i from n − 1 down to 1 with the same formula, so the middle row is not printed twice.
- Run the outer loop for
ifrom1ton, one row per pass (upper half). - Print
n − ispaces. - Print
2 × i − 1stars. - Move to the next line.
- Run the outer loop for
ifromn − 1down to1, one row per pass (lower half). - Print
n − ispaces. - Print
2 × i − 1stars. - Move to the next line.
Diamond Star Pattern in C
#include <stdio.h>
int main(void) {
int n = 5;
// upper half
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
printf(" ");
for (int j = 1; j <= 2 * i - 1; j++)
printf("*");
printf("\n");
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= n - i; j++)
printf(" ");
for (int j = 1; j <= 2 * i - 1; j++)
printf("*");
printf("\n");
}
return 0;
}Diamond Star Pattern in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
// upper half
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
cout << " ";
for (int j = 1; j <= 2 * i - 1; j++)
cout << "*";
cout << endl;
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= n - i; j++)
cout << " ";
for (int j = 1; j <= 2 * i - 1; j++)
cout << "*";
cout << endl;
}
return 0;
}Diamond Star Pattern in Java
public class DiamondStar {
public static void main(String[] args) {
int n = 5;
// upper half
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
System.out.print(" ");
for (int j = 1; j <= 2 * i - 1; j++)
System.out.print("*");
System.out.println();
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= n - i; j++)
System.out.print(" ");
for (int j = 1; j <= 2 * i - 1; j++)
System.out.print("*");
System.out.println();
}
}
}Diamond Star Pattern in Python
n = 5
# upper half
for i in range(1, n + 1):
for j in range(1, n - i + 1):
print(" ", end="")
for j in range(1, 2 * i):
print("*", end="")
print()
# lower half
for i in range(n - 1, 0, -1):
for j in range(1, n - i + 1):
print(" ", end="")
for j in range(1, 2 * i):
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).





