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
Number Half Diamond output
Output (n = 5):
1 12 123 1234 12345 1234 123 12 1

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.
- Run the outer loop for
ifrom1ton, one row per pass (upper half). - Print
inumbers (valuej). - Move to the next line.
- Run the outer loop for
ifromn − 1down to1, one row per pass (lower half). - Print
inumbers (valuej). - 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).









