矩阵转置算法

#include<iostream>

#include<stdio.h>

using namespace std;

#define n1 2

#define n2 3

inta[n1][n2],b[n2][n1];

/*int main()

{

       int a[n1][n2],b[n2][n1];

       int i,j;

       printf("请输入一个%d行%d列的矩阵:",n1,n2);

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

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

                     scanf("%d",*(a+i)+j);//使用元素a[i][j]的地址

              printf("转置后的矩阵为:\n");

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

              {

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

                     {

                            *(*(b+i)+j)=*(*(a+j)+i);//b[i][j]=a[j][i]

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

                     }

                     printf("\n");

              }

              return0;

}

 

*/

 

 

int chushihua()

{

       inti,j;

       printf("请输入一个%d行%d列的矩阵:",n1,n2);

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

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

                     scanf("%d",*(a+i)+j);

              return0;

}

 

 

int zhuanzhi()

{

       inti,j;

       printf("转置后的矩阵为:\n");

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

              {

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

                     {

                            *(*(b+i)+j)=*(*(a+j)+i);//b[i][j]=a[j][i]

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

                     }

                     printf("\n");

              }

              return0;

}

 

 

int main()

{

       chushihua();

       zhuanzhi();

       return0;

}