An inverted pyramid on top of a pyramid, shaped like an hourglass. 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 Tricky Patterns collection.
Hourglass Star Pattern output
Output (n = 5):
*********
*******
*****
***
*
***
*****
*******
*********
How the hourglass star pattern works
The first loop prints the inverted pyramid (i from n down to 1). The second loop starts at 2, not 1, so the single star in the middle is printed only once.
- Run the outer loop for
ifromndown to1, one row per pass (upper half: inverted pyramid). - Print
n − ispaces. - Print
2 × i − 1stars. - Move to the next line.
- Run the outer loop for
ifrom2ton, one row per pass (lower half: pyramid). - Print
n − ispaces. - Print
2 × i − 1stars. - Move to the next line.
Hourglass Star Pattern in C
#include <stdio.h>
int main(void) {
int n = 5;
// upper half: inverted pyramid
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= n - i; j++)
printf(" ");
for (int j = 1; j <= 2 * i - 1; j++)
printf("*");
printf("\n");
}
// lower half: pyramid
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
printf(" ");
for (int j = 1; j <= 2 * i - 1; j++)
printf("*");
printf("\n");
}
return 0;
}Hourglass Star Pattern in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
// upper half: inverted pyramid
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= n - i; j++)
cout << " ";
for (int j = 1; j <= 2 * i - 1; j++)
cout << "*";
cout << endl;
}
// lower half: pyramid
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
cout << " ";
for (int j = 1; j <= 2 * i - 1; j++)
cout << "*";
cout << endl;
}
return 0;
}Hourglass Star Pattern in Java
public class HourglassStar {
public static void main(String[] args) {
int n = 5;
// upper half: inverted pyramid
for (int i = n; 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();
}
// lower half: pyramid
for (int i = 2; 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();
}
}
}Hourglass Star Pattern in Python
n = 5
# upper half: inverted pyramid
for i in range(n, 0, -1):
for j in range(1, n - i + 1):
print(" ", end="")
for j in range(1, 2 * i):
print("*", end="")
print()
# lower half: pyramid
for i in range(2, n + 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).





