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

Inverted Right Triangle Star Pattern

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

The right triangle upside down: n stars first, one fewer on each row. 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 Star Patterns collection.

Inverted Right Triangle Star Pattern output

Output (n = 5):

*****
****
***
**
*
Inverted Right Triangle Star Pattern layout diagram, row by row (n = 5)
How each row of the inverted right triangle star pattern is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the inverted right triangle star pattern works

Same inner loop as the right triangle, with the outer loop counting i down from n to 1.

  1. Run the outer loop for i from n down to 1, one row per pass.
  2. Print i stars.
  3. Move to the next line.

Inverted Right Triangle Star Pattern in C

#include <stdio.h>

int main(void) {
    int n = 5;

    for (int i = n; i >= 1; i--) {
        for (int j = 1; j <= i; j++)
            printf("*");
        printf("\n");
    }
    return 0;
}

Inverted Right Triangle Star Pattern in C++

#include <iostream>
using namespace std;

int main() {
    int n = 5;

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

Inverted Right Triangle Star Pattern in Java

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

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

Inverted Right Triangle Star Pattern in Python

n = 5

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