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

Mirrored Half Diamond Star Pattern

Read summary with AI tools

The half diamond pointing to the left. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.

Quick answer: Print two halves with the same row formula: n − i spaces followed by i stars. The upper half runs i from 1 to n; the lower half runs i from n − 1 down to 1. The stars stay against the right edge and the point faces left.

This program is part of the Star Patterns collection.

Table of contents8 sections
  1. Output
  2. How the mirrored half diamond 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

Mirrored Half Diamond Star Pattern output

Output (n = 5):

    *
   **
  ***
 ****
*****
 ****
  ***
   **
    *
Mirrored Half Diamond Star Pattern layout diagram, row by row (n = 5)
How each row of the mirrored half diamond star pattern is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the mirrored half diamond star pattern works

The same two halves as the half diamond, but each row starts with n − i spaces.

  1. Run the outer loop for i from 1 to n, one row per pass (upper half).
  2. Print n − i spaces.
  3. Print i stars.
  4. Move to the next line.
  5. Run the outer loop for i from n − 1 down to 1, one row per pass (lower half).
  6. Print n − i spaces.
  7. Print i stars.
  8. Move to the next line.

Key takeaways

  • Both halves use the same space and star formulas; only the loop direction changes.
  • Every row is exactly n characters wide, which keeps the right edge straight.
  • The lower half starts at n − 1 so the widest row appears only once.
  • It is the half diamond with leading spaces added.

Mirrored 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 <= n - i; j++)
            printf(" ");
        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 <= n - i; j++)
            printf(" ");
        for (int j = 1; j <= i; j++)
            printf("*");
        printf("\n");
    }
    return 0;
}

Mirrored 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 <= n - i; j++)
            cout << " ";
        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 <= n - i; j++)
            cout << " ";
        for (int j = 1; j <= i; j++)
            cout << "*";
        cout << endl;
    }
    return 0;
}

Mirrored Half Diamond Star Pattern in Java

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

        // upper half
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n - i; j++)
                System.out.print(" ");
            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 <= n - i; j++)
                System.out.print(" ");
            for (int j = 1; j <= i; j++)
                System.out.print("*");
            System.out.println();
        }
    }
}

Mirrored Half Diamond Star Pattern in Python

n = 5

# upper half
for i in range(1, n + 1):
    for j in range(1, n - i + 1):
        print(" ", end="")
    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, n - i + 1):
        print(" ", end="")
    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 point face left?

All rows end in the same column, so the right side is straight. The left side follows the number of stars, which grows and then shrinks, so it forms the point.

What changes if I remove the spaces?

Without the n − i spaces the stars move to the left edge and you get the half diamond star pattern, pointing right.

How many rows are printed?

2 × n − 1: n in the upper half and n − 1 in the lower half. For n = 5 that is 9 rows.

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.