Find the Transpose of a Matrix in Java (In-Place & New Matrix Methods)

Introduction

Matrix transposition is a fundamental operation in mathematics and programming. It transforms a matrix by swapping its rows and columns, meaning the element at position (row, column) moves to (column, row).

In Java, there are two common ways to transpose a matrix:

• Create a new transposed matrix, which works for both square and rectangular matrices.
• Perform an in-place transpose, which only works for square matrices.

In this tutorial, you'll learn both approaches, understand why in-place transposition is limited to square matrices, and explore best practices, common mistakes, and practical examples.

Problem Statement

Given the following matrix:

int[][] matrix = {
    {1, 2, 3},
    {4, 5, 6}
};

The transpose is:

1 4
2 5
3 6

Or as a 2D array:

{
    {1, 4},
    {2, 5},
    {3, 6}
}

Notice that:

matrix[row][column]
        ↓
transpose[column][row]

Method 1: Create a New Matrix (Works for Any Matrix)

This is the safest and most commonly used approach.

The idea is simple:

• Create a new matrix whose dimensions are reversed.
• Copy every element from the original matrix into its transposed position.

Java Program

import java.util.Arrays;

public class Main {

    public static void main(String[] args) {

        int[][] matrix = {
            {1,2,3},
            {4,5,6}
        };

        int rows = matrix.length;
        int cols = matrix[0].length;

        int[][] transpose = new int[cols][rows];

        for (int row = 0; row < rows; row++) {

            for (int col = 0; col < cols; col++) {

                transpose[col][row] = matrix[row][col];
            }
        }

        for (int[] row : transpose) {
            System.out.println(Arrays.toString(row));
        }
    }
}

Output

[1, 4]
[2, 5]
[3, 6]

Time Complexity

O(rows × columns)

Space Complexity

O(rows × columns)

A new matrix is created to store the result.

Method 2: In-Place Transpose (Square Matrices Only)

If the matrix is square (same number of rows and columns), you can transpose it without creating another matrix.

Java Program

import java.util.Arrays;

public class Main {

    public static void transpose(int[][] matrix) {

        int n = matrix.length;

        for (int row = 0; row < n; row++) {

            for (int col = row + 1; col < n; col++) {

                int temp = matrix[row][col];
                matrix[row][col] = matrix[col][row];
                matrix[col][row] = temp;
            }
        }
    }

    public static void main(String[] args) {

        int[][] matrix = {
            {1,2,3},
            {4,5,6},
            {7,8,9}
        };

        transpose(matrix);

        for (int[] row : matrix) {
            System.out.println(Arrays.toString(row));
        }
    }
}

Output

[1, 4, 7]
[2, 5, 8]
[3, 6, 9]

Time Complexity

O(n²)

Space Complexity

O(1)

No extra matrix is created.

Why In-Place Transpose Doesn't Work for Rectangular Matrices

Consider a matrix with:

2 rows × 3 columns

After transposition, it becomes:

3 rows × 2 columns

The dimensions change.

Since Java arrays have a fixed size, a 2 × 3 array cannot magically become a 3 × 2 array.

Therefore, an in-place transpose is only possible for square matrices, where:

rows == columns

Step-by-Step Explanation

Consider the following matrix:

{
    {1,2,3},
    {4,5,6}
}

The algorithm performs:

transpose[col][row] = matrix[row][col];

The assignments become:

transpose[0][0] = 1
transpose[1][0] = 2
transpose[2][0] = 3

transpose[0][1] = 4
transpose[1][1] = 5
transpose[2][1] = 6

The resulting matrix is:

1 4
2 5
3 6

Internal Working

For the square matrix:

{
    {1,2,3},
    {4,5,6},
    {7,8,9}
}

The in-place swaps occur as follows:

Swap (0,1) with (1,0)

1 4 3
2 5 6
7 8 9

Swap (0,2) with (2,0)

1 4 7
2 5 6
3 8 9

Swap (1,2) with (2,1)

1 4 7
2 5 8
3 6 9

Final result:

1 4 7
2 5 8
3 6 9

Notice that the diagonal elements (1, 5, 9) never move.

Real-Life Analogy

Imagine a spreadsheet where rows represent students and columns represent subjects.

After transposing:

• Subjects become rows.
• Students become columns.

Every value simply swaps its row and column position.

For a square spreadsheet, this can be done by swapping values across the main diagonal.

For a rectangular spreadsheet, a new sheet with different dimensions is required.

Best Practices

• Use the new matrix approach for rectangular matrices.
• Use the in-place approach only when the matrix is square.
• Always verify that rows == columns before attempting an in-place transpose.
• Start the inner loop at col = row + 1 to avoid swapping elements twice.
• Use meaningful variable names like row and col to improve readability.

Common Mistakes

Attempting In-Place Transpose on a Rectangular Matrix

Incorrect:

transpose(matrix);

without checking whether the matrix is square.

Always validate:

matrix.length == matrix[0].length

Starting the Inner Loop at Zero

Incorrect:

for (int col = 0; col < n; col++)

This swaps elements multiple times and undoes the transpose.

Correct:

for (int col = row + 1; col < n; col++)

Forgetting to Swap Matrix Dimensions

Incorrect:

int[][] transpose = new int[rows][cols];

Correct:

int[][] transpose = new int[cols][rows];

Confusing Transpose with Rotation

Transpose:

Rows ↔ Columns

Rotation:

Turn matrix 90°

These are different operations.

Expert Tips

• Matrix transposition is a key step in many algorithms, including matrix rotation.
• A 90° clockwise rotation can be achieved by:
  1. Transposing the matrix.
  2. Reversing every row.
• In-place transposition saves memory but only works for square matrices.
• Understanding why rectangular matrices require a new array demonstrates a solid grasp of matrix representation and Java arrays.

Comparison of Approaches

Frequently Asked Questions

What is the transpose of a matrix?

The transpose of a matrix is obtained by swapping its rows and columns.

Can every matrix be transposed?

Yes. Every matrix can be transposed by creating a new matrix.

Can every matrix be transposed in place?

No. Only square matrices can be transposed in place because their dimensions remain unchanged.

Why does the inner loop start at row + 1?

It ensures each pair of symmetric elements is swapped exactly once and avoids unnecessary swaps of diagonal elements.

Do diagonal elements move during transposition?

No. Elements on the main diagonal remain in the same position because their row and column indexes are identical.

What are the dimensions of the transposed matrix?

If the original matrix is:

rows × columns

the transpose becomes:

columns × rows

Is transpose the same as rotating a matrix?

No. Transposition swaps rows and columns, whereas rotation changes the matrix orientation by a specific angle, such as 90°.

Where is matrix transposition used?

Matrix transposition is widely used in linear algebra, computer graphics, image processing, scientific computing, machine learning, and data transformation tasks.