Write a program to transpose of a matrix?

Answer 1

Program to find the Transpose of a Matrix

#include

#include

void main()

{

int i,j,n,t;

int m[5][5];

clrscr();

printf("Enter Order of Matrix : ");

scanf("%d",&n);

printf("Enter Elements of Matrix :\n\n");

for(i=0;i

{

for(j=0;j

{

scanf("%d",&m[i][j]);

}

}

printf("Transpose of the Matrix :\n\n");

for(i=0;i

{

for(j=i+1;j

{

t=m[i][j];

m[i][j]=m[j][i];

m[j][i]=t;

}

}

for(i=0;i

{

for(j=0;j

{

printf("\t%d",m[i][j]);

}

printf("\n");

}

getch();

}

Output:

Enter Order of Matrix : 3

Enter Elements of Matrix :

45 56 96

75 36 15

29 64 81

Transpose of the Matrix :

45 75 29

56 36 64

96 15 81

with out using temp variable:

#include

#include

void main()

{

int i,j,n,t;

int m[5][5];

clrscr();

printf("Enter Order of Matrix : ");

scanf("%d",&n);

printf("Enter Elements of Matrix :\n\n");

for(i=0;i

{

for(j=0;j

{

scanf("%d",&m[i][j]);

}

}

printf("Transpose of the Matrix :\n\n");

for(i=0;i

{

for(j=i+1;j

{

m[j][i]=(m[i][j]+m[j][i]-(m[i][j]=m[j][i]));

}

}

for(i=0;i

{

for(j=0;j

{

printf("\t%d",m[i][j]);

}

printf("\n");

}

getch();

}

Answer 2

Algorithm for the Transpose of a Sparse-Matrix:This is the algorithm that converts a compressed-column sparse matrix into a compressed-row sparse matrix. It computes number of rows in A, compares the cummulative sum to generate row pointers and then iterates over each nonzero entry in A, storing the entry in its corresponding row vector. If the matrix resulted in this procedure is a sparce matrix C and can be interpreted as a matrix in compressed-row form then, C is equal to A. If C is a compressed-column matrix, then C contains Transpose of A.

The code is

cs *cs_transpose(const cs *A, int values)

{

int p,q,j,*cp,*ci,n,m,*Ap,*Ai,*W;

cs *C;

double *Cx,*Ax;

if(!CS_CSC(A))

return(NULL);

m=A->m;

n=A->n;

Ap=A->p;

Ai=A->i;

Ax=A->x;

C=cs_spalloc(n,m,Ap[n],values && Ax,0);

W=cs_calloc(m,sizeof(int));

if(!C!W)

return(cs_done(C,W,NULL,0));

Cp=C->p;

Ci=C->i;

Cx=C->x;

for(p=0;p

W[Ai[p]]++;

cs_cumsum(Cp,W,m);

for(j=0;j

{

for(p=Ap[j];p

{

Ci[q=W[Ai[p]]++]=j;

if(Cx)

Cx[q]=Ax=[p];

}

}

return(cs_done(C,W,NULL,1));

}