The full pyramid turned upside down: the widest row comes first. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.
Quick answer: Run the outer loop from i = n down to 1. On each row print n − i spaces and then 2 × i − 1 stars. The first row has 2 × n − 1 stars and no spaces; each row after it is indented by one more space and has two stars fewer.
This program is part of the Pyramid Patterns collection.
Table of contents8 sections
Inverted Pyramid Star Pattern output
Output (n = 5):
*********
*******
*****
***
*
How the inverted pyramid star pattern works
The loop counts i down from n to 1, but each row uses the same formula as the full pyramid: n − i spaces and 2i − 1 stars.
- Run the outer loop for
ifromndown to1, one row per pass. - Print
n − ispaces. - Print
2 × i − 1stars. - Move to the next line.
Key takeaways
- Same formulas as the full pyramid; only the loop direction changes.
- The stars go 9, 7, 5, 3, 1 for
n = 5: always an odd number. - The first row has no spaces because
n − i = 0wheni = n. - Total stars:
n².
Inverted Pyramid Star Pattern in C
#include <stdio.h>
int main(void) {
int n = 5;
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");
}
return 0;
}Inverted Pyramid Star Pattern in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
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;
}
return 0;
}Inverted Pyramid Star Pattern in Java
public class InvertedPyramidStar {
public static void main(String[] args) {
int n = 5;
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();
}
}
}Inverted Pyramid Star Pattern in Python
n = 5
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()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
Can I write it with i counting up?
Yes: loop i from 1 to n, print i − 1 spaces and 2 × (n − i) + 1 stars.
Why does each row lose one star on each side?
Each row has two stars fewer and one more space, so it shrinks by one star at both ends and stays centred.
How do I make it hollow?
Print stars only on the two edges and the first row. See the hollow inverted pyramid star pattern.










