The outline of an upside-down pyramid. 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.
Hollow Inverted Pyramid Star Pattern output
Output (n = 5):
*********
* *
* *
* *
*
How the hollow inverted pyramid star pattern works
The hollow pyramid condition with i counting down: the full top row first, then only the two slanted edges.
- Run the outer loop for
ifromndown to1, one row per pass. - Go through
n + i ā 1positions in the row. Print stars wherej = n ā i + 1 or j = n + i ā 1 or i = n; print spaces everywhere else. - Move to the next line.
Hollow 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 - 1; j++) {
if (j == n - i + 1 || j == n + i - 1 || i == n)
printf("*");
else
printf(" ");
}
printf("\n");
}
return 0;
}Hollow 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 - 1; j++) {
if (j == n - i + 1 || j == n + i - 1 || i == n)
cout << "*";
else
cout << " ";
}
cout << endl;
}
return 0;
}Hollow Inverted Pyramid Star Pattern in Java
public class HollowInvertedPyramidStar {
public static void main(String[] args) {
int n = 5;
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= n + i - 1; j++) {
if (j == n - i + 1 || j == n + i - 1 || i == n)
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
}
}Hollow Inverted Pyramid Star Pattern in Python
n = 5
for i in range(n, 0, -1):
for j in range(1, n + i):
if j == n - i + 1 or j == n + i - 1 or i == n:
print("*", end="")
else:
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).





