用C的数组实现矩阵的加减乘与求转置

#include<stdio.h>
#include<time.h>
#include <stdlib.h>
#define N 20
void MatrixSum(int matrix1[N][N], int matrix2[N][N]);					//矩阵加法
void MatrixSubstract(int matrix1[N][N], int matrix2[N][N]);				//矩阵减法
void MatrixMultiple(int matrix1[N][N], int matrix2[N][N]);				//矩阵乘法
void MatrixTransposematrix(int matrix1[N][N]);							//矩阵转置
int main(){
    
// 生成俩个随机数组 matrix1,matrix2
	int matrix1[N][N], matrix2[N][N];
	srand((unsigned)time(NULL));
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++) {
    
			matrix1[i][j] = rand()%11;
		}
	}
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++) {
    
			matrix2[i][j] = rand() % 11;
		}
	}

// 检查随机数组的生成
	for (int i = 0; i <N; i++) {
    
		for (int j = 0; j <N; j++) {
    
			
			printf("%d ", matrix1[i][j]);
		}
		printf("\n");
	}
	printf("\n");
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++) {
    

			printf("%d ", matrix2[i][j]);
		}
		printf("\n");
	}
	printf("\n");

	//调用矩阵加法
	//MatrixSum( matrix1, matrix2);

	//调用矩阵减法
	//MatrixSubstract(matrix1, matrix2);

	//调用矩阵乘法
	//MatrixMultiple(matrix1, matrix2);

	//调用矩阵转置求法
	MatrixTransposematrix(matrix1);
}

//矩阵加法的实现
void MatrixSum(int matrix1[N][N], int matrix2[N][N]) {
    
	int result[N][N];
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++) {
    
			result[i][j] = matrix1[i][j]+ matrix2[i][j];				//从 matrix1[0][0] 开始与 matrix2[0][0] 相加 并 循环赋值 给result
		}
	}
	printf("矩阵加法的结果为:\n");
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++){
    
			printf("%d ", result[i][j]);
		}
		printf("\n");
	}
}

//矩阵减法的实现
void MatrixSubstract(int matrix1[N][N], int matrix2[N][N]) {
    
	int result[N][N];
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++) {
    
			result[i][j] = matrix1[i][j] - matrix2[i][j];				//从 matrix1[0][0] 开始与 matrix2[0][0] 相减 并 循环赋值 给result
		}
	}
	printf("矩阵减法的结果为:\n");
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++) {
    
			printf("%d ", result[i][j]);
		}
		printf("\n");
	}


}


//矩阵乘法的实现 
void MatrixMultiple(int matrix1[N][N], int matrix2[N][N]) {
    
	int result[N][N];
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++)
		{
    
			float ret = 0;
			for (int k = 0; k < N; k++)
			{
    
				ret += matrix1[i][k] * matrix2[k][j];					//按照矩阵的乘法规则进行运算
			}
			result[i][j] = ret;
		}
	}
	printf("矩阵的相乘结果为：\n");
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++) {
    
			printf("%d ", result[i][j]);
		}
		printf("\n");
	}
}

	//求矩阵的转置的实现
void MatrixTransposematrix(int matrix1[N][N]) {
    
	int result[N][N];
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++) {
    
			result[j][i] = matrix1[i][j];								//实现转置
		}
	}
	printf("矩阵的转置为：\n");
	for (int i = 0; i < N; i++) {
    
		for (int j = 0; j < N; j++) {
    
			printf("%d ", result[i][j]);
		}
		printf("\n");

	}
}