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

Square Star Pattern

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

Square Star Pattern output

Output (n = 5):

* * * * *
* * * * *
* * * * *
* * * * *
* * * * *
Square Star Pattern layout diagram, row by row (n = 5)
How each row of the square star pattern is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the square star pattern works

The outer loop prints n rows and the inner loop prints n stars in each row, so every position is filled.

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

Square Star Pattern in C

#include <stdio.h>

int main(void) {
    int n = 5;

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

Square Star Pattern in C++

#include <iostream>
using namespace std;

int main() {
    int n = 5;

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

Square Star Pattern in Java

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

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

Square Star Pattern in Python

n = 5

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