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

Consecutive Number Square

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

The numbers 1 to n² fill the square row by row. 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 Patterns collection.

Consecutive Number Square output

Output (n = 4):

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

How the consecutive number square works

Each full row before row i holds n numbers. So the value at row i, column j is (i − 1) × n + j.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Print n numbers (value (i − 1) × n + j).
  3. Move to the next line.

Consecutive Number Square in C

#include <stdio.h>

int main(void) {
    int n = 4;

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

Consecutive Number Square in C++

#include <iostream>
#include <iomanip>
using namespace std;

int main() {
    int n = 4;

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

Consecutive Number Square in Java

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

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++)
                System.out.printf("%3d", (i - 1) * n + j);
            System.out.println();
        }
    }
}

Consecutive Number Square in Python

n = 4

for i in range(1, n + 1):
    for j in range(1, n + 1):
        print(f"{(i - 1) * n + j:3d}", 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.