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

Rectangle Star Pattern

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

A filled rectangle of stars that is twice as wide as it is tall. 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.

Rectangle Star Pattern output

Output (4 rows, 8 columns):

********
********
********
********
Rectangle Star Pattern layout diagram, row by row (4 rows, 8 columns)
How each row of the rectangle star pattern is built (4 rows, 8 columns). Blue cells are printed characters; grey dots are spaces.

How the rectangle star pattern works

The outer loop prints n rows. The inner loop prints 2n stars on every row, so the width does not change from row to row.

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

Rectangle Star Pattern in C

#include <stdio.h>

int main(void) {
    int n = 4;

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

Rectangle Star Pattern in C++

#include <iostream>
using namespace std;

int main() {
    int n = 4;

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

Rectangle Star Pattern in Java

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

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

Rectangle Star Pattern in Python

n = 4

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