Algorithm and Flowchart to Find transpose of a matrix

Transpose of a matrix is obtained by changing rows to columns and columns to rows. It is denoted by A^T

Flowchart to find transpose of a matrix

Remove WaterMark from Above Flowchart

Pseudocode to find transpose of a matrix

In the above algorithm,

1. We first declare two matrices a and b of order mxn
2. Then we read matrix a from the user. We will use matrix b to store transpose of the matrix.
3. Now, we declare two variables i, j and initialize them to 0
4. After this we start a loop of i, till it reaches n which gave us the column indexes and inside it a loop of j which gives us the elements of the row.

The statement b[i][j] = a[j][i] gives the value of a by changing the row to column and column to row and stores in b. for e.g. i=1, j=2 then b[1][2]=a[2][1], thus assigning the matrix b to the transpose of a.

Recommended:

• Algorithm and Flowchart for Matrix addition
• Algorithm and Flowchart for Subtraction of Two Matrix
• Algorithm and Flowchart for Matrix Multiplication