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

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





