Write a c program using dynamic memory allocation to transpose a matrix?

Answer 1

Type your answervoid main()

{

int **a,**b,**c;

//int c[3][3];

int a_r,a_c,b_r,b_c;

int i,j,k;

clrscr();

again:

printf("\nenter rows and columns for matrix one:");

scanf("d",&a_r,&a_c);

printf("\nenter rows and columns for matrix two:");

scanf("d",&b_r,&b_c);

if(a_c!=b_r )

{

printf("\ncan not multiply");

goto again;

}

/* allocate memory for matrix one */

a=(int **) malloc(sizeof(int *),a_r);

for( i=0;i {

a[i]=(int *) malloc(sizeof(int*)*a_c);

}

/* allocate memory for matrix two */

b=(int **) malloc(sizeof(int)*b_r);

for( i=0;i {

b[i]=(int *) malloc(sizeof(int*)*b_c);

}

/* allocate memory for sum matrix */

c=(int **) malloc(sizeof(int *)*a_r);

for( i=0;i {

c[i]=(int *) malloc(sizeof(int)*b_c);

}

printf("\n enter matrix one %d by %d\n",a_r,a_c);

for(i=0;i {

for(j=0;j {

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

}

}

printf("\n enter matrix two %d by %d\n",b_r,b_c);

for(i=0;i {

for(j=0;j {

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

}

}

/*initialize product matrix */

for(i=0;i {

for(j=0;j {

c[i][j]=0;

}

}

/* multiply matrix one and matrix two */

for(i=0;i {

for(j=0;j {

for(k=0;k {

c[i][j]=c[i][j]+a[i][k]*b[k][j];

}

}

}

/* display result */

printf("\n Product of matrix one and two is\n");

for(i=0;i {

for(j=0;j {

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

}

printf("\n");

}

/*free memory*/

for(i=0;i {

free(a[i]);

}

free(a);

for(i=0;i {

free(b[i]);

}

free(b);

for(i=0;i {

free(c[i]);

}

free(c);

printf("\npress any key");

getch();

}

I would suggest you go to

http://code.freefeast.info/matrix-multiplication-using-pointers-in-c-dynamic-matrix-multiplication-in-c/

It has got a well formatted and commented code for this problem

Answer 2

// By Anil Kumar Sahni 20 april 2012 mob 9415683164

#include<stdio.h>

#include<stdlib.h>

void main()

{

int **a;

int ar,ac;

int i,j;

printf("\nenter rows and columns for matrix :");

scanf("%d%d",&ar,&ac);

/* allocate memory for matrix */

a=(int **) malloc(sizeof(int *)*ar);

for( i=0;i<ar;i++)

{

a[i]=(int *) malloc(sizeof(int*)*ac);

}

// matrix input

printf("\n enter matrix one %d by %d\n",ar,a c);

for(i=0;i<ar;i++)

{

for(j=0;j<ac;j++)

{

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

}

}

//output matrix

printf("\n Transpose of matrix one and two is\n");

for(i=0;i<ac;i++)

{

for(j=0;j<ar;j++)

{

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

}

printf("\n");

}

/*free memory*/

for(i=0;i<ar;i++)

{

free(a[i]);

}

free(a);

} // end of main body

Answer 3

/*dynamically creates a matrix with 'm' rows and 'n' columns;the matrix can store integer values*/

int **matrix;

int i,j;

matrix=malloc(m*sizeof(int *));

for(i=0;i<m;++i)

matrix[i]=malloc(n*sizeof(int));

Answer 4

I want to make dynamic matrix multiplication