数据结构作业11--二维数组与矩阵乘法

代码本体

#include<iostream>
using namespace std;
typedef struct TwoDArray{
	int rows;
	int columns;
	int** elements;
}TwoDArray,*TwoDArrayPtr;; 
typedef struct TwoDStaticArray{
	int rows;
	int columns;
	int elements[4][5];
}TwoDStaticArray,*TwoDStaticArrayPtr;
TwoDArrayPtr initTwoDArray(int paraRows, int paraColumns){
	TwoDArrayPtr resultPtr=(TwoDArrayPtr)malloc(sizeof(TwoDArray));
	resultPtr->rows=paraRows;
	resultPtr->columns=paraColumns;
	resultPtr->elements=(int**)malloc(sizeof(int*)*paraRows);
	for(int i=0;i<paraRows;i++){
		resultPtr->elements[i]=(int*)malloc(sizeof(int)*paraColumns);
	}
	return resultPtr;
}
void randomizeTwoDArray(TwoDArrayPtr paraPtr,int paraLowerBound,int paraUpperBound){
	for(int i=0;i<paraPtr->rows;i++){
		for(int j=0;j<paraPtr->columns;j++){
			paraPtr->elements[i][j]=rand()%(paraUpperBound-paraLowerBound)+paraLowerBound;
		}
	}
}
void printTwoDArray(TwoDArrayPtr paraPtr){
	for(int i=0;i<paraPtr->rows;i++){
		for(int j=0;j<paraPtr->columns;j++){
			printf("%d ",paraPtr->elements[i][j]);
		}
		printf("\r\n");
	}
}
TwoDArrayPtr matrixMultiply(TwoDArrayPtr paraPtr1,TwoDArrayPtr paraPtr2){
	if(paraPtr1->columns!=paraPtr2->rows){
		printf("Matrices cannot be multiplied.\r\n");
		return nullptr;
	}
	int sum=0;
	TwoDArrayPtr resultPtr=initTwoDArray(paraPtr1->rows,paraPtr2->columns);
	for(int i=0;i<paraPtr1->rows;i++){
		for(int j=0;j<paraPtr2->columns;j++){
			sum=0;
			for(int k=0;k<paraPtr1->columns;k++){
				sum+=paraPtr1->elements[i][k]*paraPtr2->elements[k][j];
			}
			resultPtr->elements[i][j]=sum;
			printf("sum = %d ",sum);
		}
	}
	return resultPtr;
}
void twoDArrayTest(){
	TwoDArrayPtr tempPtr1,tempPtr2,tempPtr3;
	tempPtr1=initTwoDArray(3,2);
	randomizeTwoDArray(tempPtr1,1,5);
	printf("The first matrix:\r\n");
	printTwoDArray(tempPtr1);
	tempPtr2=initTwoDArray(2,4);
	randomizeTwoDArray(tempPtr2,4,9);
	printf("The second matrix:\r\n");
	printTwoDArray(tempPtr2);
	tempPtr3=matrixMultiply(tempPtr1, tempPtr2);
	printf("The result:\r\n");
	printTwoDArray(tempPtr3);
}
TwoDStaticArrayPtr initTwoDStaticArray(){
	TwoDStaticArrayPtr resultPtr=(TwoDStaticArrayPtr)malloc(sizeof(struct TwoDStaticArray));
	resultPtr->rows=4;
	resultPtr->columns=5;
	for (int i=0;i<4;i++){
		for (int j=0;j<5;j++){
			resultPtr->elements[i][j]=i*10+j;
			printf("(%d, %d): %d; ",i,j,&(resultPtr->elements[i][j]));
		}
	}
    return resultPtr;
}
int main(){
	twoDArrayTest();
	TwoDStaticArrayPtr tempPtr=initTwoDStaticArray();
	return 0;
}

运行结果

The first matrix:
2, 4,
3, 1,
2, 1,
The second matrix:
7, 7, 6, 8,
4, 4, 5, 6,
sum = 30, sum = 30, sum = 32, sum = 40, sum = 25, sum = 25, sum = 23, sum = 30, sum = 18, sum = 18, sum = 17, sum = 22, The result:
30, 30, 32, 40,
25, 25, 23, 30,
18, 18, 17, 22,
(0, 0): 7356432; (0, 1): 7356436; (0, 2): 7356440; (0, 3): 7356444; (0, 4): 7356448; (1, 0): 7356452; (1, 1): 7356456; (1, 2): 7356460; (1, 3): 7356464; (1, 4): 7356468; (2, 0): 7356472; (2, 1): 7356476; (2, 2): 7356480; (2, 3): 7356484; (2, 4): 7356488; (3, 0): 7356492; (3, 1): 7356496; (3, 2): 7356500; (3, 3): 7356504; (3, 4): 7356508; Press any key to continue

代码说明

1. 两种空间分配方案.
2. 矩阵的乘法复杂度为 O ( m n k ) O(mnk)O(mnk).
3. 打印地址可以知道其存储方式.

图示