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

Diamond Star Pattern

Read summary with AI tools
Table of contents
  1. Output
  2. How the 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. Related patterns

A full pyramid followed by an inverted pyramid, which together make a diamond. 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.

Diamond Star Pattern output

Output (n = 5):

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

How the diamond star pattern works

The first loop prints the upper half exactly like the full pyramid. The second loop runs i from n − 1 down to 1 with the same formula, so the middle row is not printed twice.

  1. Run the outer loop for i from 1 to n, one row per pass (upper half).
  2. Print n − i spaces.
  3. Print 2 × i − 1 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 2 × i − 1 stars.
  8. Move to the next line.

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

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 <= 2 * i - 1; 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 <= 2 * i - 1; j++)
            cout << "*";
        cout << endl;
    }
    return 0;
}

Diamond Star Pattern in Java

public class DiamondStar {
    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 <= 2 * i - 1; 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 <= 2 * i - 1; j++)
                System.out.print("*");
            System.out.println();
        }
    }
}

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, 2 * i):
        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, 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).

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.