数据结构与算法读书笔记 - 006 - C++高速缓存测试和矩阵乘法

//
//  main.cpp
//  Matrix_5
//
//  Created by Bert Jiachen Wang on 1/17/21.
//

#include <iostream>
#include <time.h>
#include <string>

using std::cout; using std::endl;
using std::string;

void make2dMatrix(int** &x, const int size)
{
   
    x = new int*[size];
    for(int i = 0; i < size; ++i)
    {
   
        x[i] = new int[size];
    }
}

void print2dMatrix(int** const &x, const int size)
{
   
    for(int i = 0; i < size; ++i)
    {
   
        for(int j = 0; j < size; ++j)
        {
   
            cout << x[i][j] << " ";
        }
        cout << endl;
    }
    cout << endl;
}

void init2dMatirx(int** &x, const int size)
{
   
    for(int i = 0; i < size; ++i)
    {
   
        for(int j = 0; j < size; ++j)
        {
   
            x[i][j] = 0;
        }
    }
}

void construct2dMatrix_increase(int** &x, const int size)
{
   
    int num = 0;
    for(int i = 0; i < size; ++i)
    {
   
        for(int j = 0; j < size; ++j)
        {
   
            ++num;
            x[i][j] = num;
        }
    }
}

void construct2dMatrix_decrease(int** &x, const int size)
{
   
    int num = size * size;
    for(int i = 0; i < size; ++i)
    {
   
        for(int j = 0; j < size; ++j)
        {
   
            x[i][j] = num;
            --num;
        }
    }
}

//matirx multiply -> textbooks
void multiply2dMatrix_a0(int** &result, int** const &left, int** const &right, const int size)
{
   
    for(int i = 0