To find the transpose of the matrix of order m*n using array

In the last page I have  written a program to find the largest number in array. Now lets move towards something new. Now lets find the transpose of the entered matrix.For this we should know what transpose means. Transpose means changing rows into columns and vice versa. To get more idea lets have a look for the source code and the output for the program.

The source code of the above program is:

	#include<stdio.h>
	#include<conio.h>
	int main()
	{
	int num[3][3];
	int a,b,m,n;
	printf("enter the order of whose transpose is to be find\n");
	scanf("%d%d",&m,&n);
	for(a=0;a<m;a++)
	{
	for(b=0;b<n;b++)
	{
	printf("enter matrix element %d\n",a+1);
	scanf("%d",&num[a][b]);
	}
	}
	printf("the matrix form of the entered elements is\n");
	for(a=0;a<m;a++)
	{
	for(b=0;b<n;b++)
	{
	printf(" %d",num[a][b]);
	}
	printf("\n");
	}
	printf("the transpose of the matrix is\n");
	for(a=0;a<m;a++)
	{
	for(b=0;b<n;b++)
	{
	printf(" %d",num[b][a]);
	}
	printf("\n");
	}
	}

view raw transpose of matrix hosted with ❤ by GitHub