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

Number-Star Square (1*2*3*4)

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

Consecutive numbers fill a square, with a star between each pair of numbers. The logic is explained step by step, and the full program is given in C, C++, Java and Python.

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

Number-Star Square output

Output (n = 4):

1*2*3*4
5*6*7*8
9*10*11*12
13*14*15*16
Number-Star Square layout diagram, row by row (n = 4)
How each row of the number-star square is built (n = 4). Blue cells are printed characters; grey dots are spaces.

How the number-star square works

Each row has 2n − 1 positions. Odd positions hold numbers and even positions hold stars. The number at odd position j is (i − 1) × n + (j + 1) / 2.

  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 − 1) × n + (j + 1) / 2) where j % 2 = 1; print stars everywhere else.
  3. Move to the next line.

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 - 1) * n + (j + 1) / 2);
            else
                printf("*");
        }
        printf("\n");
    }
    return 0;
}

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 - 1) * n + (j + 1) / 2;
            else
                cout << "*";
        }
        cout << endl;
    }
    return 0;
}

Number-Star Square in Java

public class NumberStarSquare {
    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 - 1) * n + (j + 1) / 2);
                else
                    System.out.print("*");
            }
            System.out.println();
        }
    }
}

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 - 1) * n + (j + 1) // 2, 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.