New: 203 pattern programs with tested code in C, C++, Java and Python Explore patterns

Hollow Trapezium Star Pattern

Read summary with AI tools

The hollow trapezium star pattern draws only the outline of a trapezium: a short flat top, a long flat base and two slanted sides.

Quick answer: Row i covers the columns n − i + 1 to 2n + i − 1. Print the top and bottom rows in full, and on the rows between print a star only at those two end columns. Everything else, including the indent, is a space.

This program is part of the Star Patterns collection.

Table of contents8 sections
  1. Output
  2. How the hollow trapezium star pattern works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity
  8. Frequently asked questions

Hollow Trapezium Star Pattern output

Output (n = 4):

   *****
  *     *
 *       *
***********
Hollow Trapezium Star Pattern layout diagram, row by row (n = 4)
How each row of the hollow trapezium star pattern is built (n = 4). Blue cells are printed characters; grey dots are spaces.

How the hollow trapezium star pattern works

Start from the solid trapezium, whose row i runs from column n − i + 1 to 2n + i − 1. Hollowing it out means keeping the full first and last rows and only the end columns in between. The check j > n − i makes sure the indent never counts as part of the shape.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Go through 2 × n + i − 1 positions in the row. Print stars where j > n − i and (i = 1 or i = n or j = n − i + 1 or j = 2 × n + i − 1); print spaces everywhere else.
  3. Move to the next line.

Key takeaways

  • Each row runs from column n − i + 1 to 2n + i − 1.
  • The flat top and base are printed in full.
  • The slanted sides are the two end columns of each row.
  • The inside grows by two spaces per row.

Hollow Trapezium Star Pattern in C

#include <stdio.h>

int main(void) {
    int n = 4;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 2 * n + i - 1; j++) {
            if (j > n - i && (i == 1 || i == n || j == n - i + 1 || j == 2 * n + i - 1))
                printf("*");
            else
                printf(" ");
        }
        printf("\n");
    }
    return 0;
}

Hollow Trapezium Star Pattern in C++

#include <iostream>
using namespace std;

int main() {
    int n = 4;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 2 * n + i - 1; j++) {
            if (j > n - i && (i == 1 || i == n || j == n - i + 1 || j == 2 * n + i - 1))
                cout << "*";
            else
                cout << " ";
        }
        cout << endl;
    }
    return 0;
}

Hollow Trapezium Star Pattern in Java

public class HollowTrapeziumStar {
    public static void main(String[] args) {
        int n = 4;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= 2 * n + i - 1; j++) {
                if (j > n - i && (i == 1 || i == n || j == n - i + 1 || j == 2 * n + i - 1))
                    System.out.print("*");
                else
                    System.out.print(" ");
            }
            System.out.println();
        }
    }
}

Hollow Trapezium Star Pattern in Python

n = 4

for i in range(1, n + 1):
    for j in range(1, 2 * n + i):
        if j > n - i and (i == 1 or i == n or j == n - i + 1 or j == 2 * n + i - 1):
            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).

Frequently asked questions

Why is the top row full but short?

The top row is part of the outline, so all its stars are printed. It is short because the trapezium is narrow at the top: n + 1 stars.

How is this different from the hollow pyramid?

The hollow pyramid comes to a point with one star on top. The trapezium has a flat top several stars wide.

How do I let the user choose the size?

Read n from the keyboard instead of fixing it in the code: scanf("%d", &n); in C, cin >> n; in C++, new Scanner(System.in).nextInt() in Java and int(input()) in Python.

Authored by

Ghanendra Yadav runs Pattern Programs from Bangalore, India. The site started in 2020 to help students practise loops and logic through pattern programs in C, C++, Java and Python. Every program published here is compiled and run before it goes live, and the output shown is the real output.

Latest articles

Leave a comment

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.