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

Number-Star Half Diamond (Sandwich)

Read summary with AI tools
Table of contents
  1. Number-Star Half Diamond output
  2. How the number-star half diamond works
  3. Number-Star Half Diamond in C
  4. Number-Star Half Diamond in C++
  5. Number-Star Half Diamond in Java
  6. Number-Star Half Diamond in Python
  7. Time and space complexity
  8. Related patterns

The number-star triangle followed by its inverse, so the rows grow and then shrink. 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 Number-Star Patterns collection.

Number-Star Half Diamond output

Output (n = 4):

1
2*2
3*3*3
4*4*4*4
3*3*3
2*2
1
Number-Star Half Diamond layout diagram, row by row (n = 4)
How each row of the number-star half diamond is built (n = 4). Blue cells are printed characters; grey dots are spaces.

How the number-star half diamond works

Print the number-star triangle for i = 1 to n, then again for i = n − 1 down to 1.

  1. Run the outer loop for i from 1 to n, one row per pass (upper half).
  2. Go through 2 × i − 1 positions in the row. Print numbers (value i) where j % 2 = 1; print stars everywhere else.
  3. Move to the next line.
  4. Run the outer loop for i from n − 1 down to 1, one row per pass (lower half).
  5. Go through 2 × i − 1 positions in the row. Print numbers (value i) where j % 2 = 1; print stars everywhere else.
  6. Move to the next line.

Number-Star Half Diamond in C

#include <stdio.h>

int main(void) {
    int n = 4;

    // upper half
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 2 * i - 1; j++) {
            if (j % 2 == 1)
                printf("%d", i);
            else
                printf("*");
        }
        printf("\n");
    }

    // lower half
    for (int i = n - 1; i >= 1; i--) {
        for (int j = 1; j <= 2 * i - 1; j++) {
            if (j % 2 == 1)
                printf("%d", i);
            else
                printf("*");
        }
        printf("\n");
    }
    return 0;
}

Number-Star Half Diamond in C++

#include <iostream>
using namespace std;

int main() {
    int n = 4;

    // upper half
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 2 * i - 1; j++) {
            if (j % 2 == 1)
                cout << i;
            else
                cout << "*";
        }
        cout << endl;
    }

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

Number-Star Half Diamond in Java

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

        // upper half
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= 2 * i - 1; j++) {
                if (j % 2 == 1)
                    System.out.print(i);
                else
                    System.out.print("*");
            }
            System.out.println();
        }

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

Number-Star Half Diamond in Python

n = 4

# upper half
for i in range(1, n + 1):
    for j in range(1, 2 * i):
        if j % 2 == 1:
            print(i, end="")
        else:
            print("*", end="")
    print()

# lower half
for i in range(n - 1, 0, -1):
    for j in range(1, 2 * i):
        if j % 2 == 1:
            print(i, 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).

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.