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

Number Half Diamond (1, 12, 123, 12, 1)

Read summary with AI tools

The number right triangle followed by its mirror image, pointing to the right. 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 Patterns collection.

Table of contents7 sections
  1. Number Half Diamond output
  2. How the number half diamond works
  3. Number Half Diamond in C
  4. Number Half Diamond in C++
  5. Number Half Diamond in Java
  6. Number Half Diamond in Python
  7. Time and space complexity

Number Half Diamond output

Output (n = 5):

1
12
123
1234
12345
1234
123
12
1
Number Half Diamond layout diagram, row by row (n = 5)
How each row of the number half diamond is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the number half diamond works

The first loop prints 1 to i for i = 1 to n. The second loop starts at n − 1, so the longest row appears only once.

  1. Run the outer loop for i from 1 to n, one row per pass (upper half).
  2. Print i numbers (value j).
  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. Print i numbers (value j).
  6. Move to the next line.

Number Half Diamond 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 <= i; j++)
            printf("%d", j);
        printf("\n");
    }

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

Number Half Diamond 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 <= i; j++)
            cout << j;
        cout << endl;
    }

    // lower half
    for (int i = n - 1; i >= 1; i--) {
        for (int j = 1; j <= i; j++)
            cout << j;
        cout << endl;
    }
    return 0;
}

Number Half Diamond in Java

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

        // upper half
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++)
                System.out.print(j);
            System.out.println();
        }

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

Number Half Diamond in Python

n = 5

# upper half
for i in range(1, n + 1):
    for j in range(1, i + 1):
        print(j, end="")
    print()

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