A right triangle followed by an inverted one, pointing to the right. This tutorial shows the output, a row-by-row diagram and the complete program in C, C++, Java and Python.
Quick answer: Print the shape in two halves. First loop i from 1 to n and print i stars per row; then loop i from n − 1 down to 1 and print i stars per row. For n = 5 the row lengths are 1 2 3 4 5 4 3 2 1, nine rows in total.
This program is part of the Star Patterns collection.
Table of contents8 sections
Half Diamond Star Pattern output
Output (n = 5):
* ** *** **** ***** **** *** ** *

How the half diamond star pattern works
Print 1 to n stars, then n − 1 down to 1. Starting the second loop at n − 1 prints the widest row only once.
- Run the outer loop for
ifrom1ton, one row per pass (upper half). - Print
istars. - Move to the next line.
- Run the outer loop for
ifromn − 1down to1, one row per pass (lower half). - Print
istars. - Move to the next line.
Key takeaways
- The upper half is a right triangle; the lower half is an inverted right triangle without its first row.
- The lower half starts at
n − 1, notn, so the longest row is printed only once. - The shape has
2 × n − 1rows. - It uses
n × nstars in total: 25 forn = 5.
Half 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 <= i; j++)
printf("*");
printf("\n");
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= i; j++)
printf("*");
printf("\n");
}
return 0;
}Half 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 <= i; j++)
cout << "*";
cout << endl;
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= i; j++)
cout << "*";
cout << endl;
}
return 0;
}Half Diamond Star Pattern in Java
public class HalfDiamondStar {
public static void main(String[] args) {
int n = 5;
// upper half
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++)
System.out.print("*");
System.out.println();
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= i; j++)
System.out.print("*");
System.out.println();
}
}
}Half Diamond Star Pattern in Python
n = 5
# upper half
for i in range(1, n + 1):
for j in range(1, i + 1):
print("*", end="")
print()
# lower half
for i in range(n - 1, 0, -1):
for j in range(1, i + 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 does the second loop start at n − 1?
Row n, the widest row, is already printed by the first loop. Starting the second loop at n would print it twice and flatten the point.
Can I print it with one loop?
Yes: loop i from 1 to 2 × n − 1 and print n − |n − i| stars on each row. Two loops are easier to read, which is why the programs here use them.
How do I make it point the other way?
Add n − i spaces before the stars in both halves. That is the mirrored half diamond star pattern.










