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):
* * * * * * * * * * * * * * * * * * * * * * * * *

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.
- Run the outer loop for
ifrom1ton, one row per pass. - Print
nstars. - 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).





