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

Inverted Number-Star Triangle

Read summary with AI tools
Table of contents
  1. Output
  2. How the inverted number-star triangle 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

The number-star triangle upside down, starting with the widest row. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.

This program is part of the Number-Star Patterns collection.

Inverted Number-Star Triangle output

Output (n = 5):

5*5*5*5*5
4*4*4*4
3*3*3
2*2
1
Inverted Number-Star Triangle layout diagram, row by row (n = 5)
How each row of the inverted number-star triangle is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the inverted number-star triangle works

The same row rule as the number-star triangle, with i counting down from n to 1.

  1. Run the outer loop for i from n down to 1, one row per pass.
  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.

Inverted Number-Star Triangle in C

#include <stdio.h>

int main(void) {
    int n = 5;

    for (int i = n; 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;
}

Inverted Number-Star Triangle in C++

#include <iostream>
using namespace std;

int main() {
    int n = 5;

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

Inverted Number-Star Triangle in Java

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

        for (int i = n; 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();
        }
    }
}

Inverted Number-Star Triangle in Python

n = 5

for i in range(n, 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.