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

Row Number-Star Square (1*1*1*1)

Read summary with AI tools
Table of contents
  1. Row Number-Star Square output
  2. How the row number-star square works
  3. Row Number-Star Square in C
  4. Row Number-Star Square in C++
  5. Row Number-Star Square in Java
  6. Row Number-Star Square in Python
  7. Time and space complexity
  8. Related patterns

Every row repeats its row number, joined with stars. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.

This program is part of the Number-Star Patterns collection.

Row Number-Star Square output

Output (n = 4):

1*1*1*1
2*2*2*2
3*3*3*3
4*4*4*4
Row Number-Star Square layout diagram, row by row (n = 4)
How each row of the row number-star square is built (n = 4). Blue cells are printed characters; grey dots are spaces.

How the row number-star square works

Odd positions print the row number i and even positions print a star.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Go through 2 × n − 1 positions in the row. Print numbers (value i) where j % 2 = 1; print stars everywhere else.
  3. Move to the next line.

Row Number-Star Square 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 - 1; j++) {
            if (j % 2 == 1)
                printf("%d", i);
            else
                printf("*");
        }
        printf("\n");
    }
    return 0;
}

Row Number-Star Square 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 - 1; j++) {
            if (j % 2 == 1)
                cout << i;
            else
                cout << "*";
        }
        cout << endl;
    }
    return 0;
}

Row Number-Star Square in Java

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

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

Row Number-Star Square in Python

n = 4

for i in range(1, n + 1):
    for j in range(1, 2 * n):
        if j % 2 == 1:
            print(i, end="")
        else:
            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.