求二范数C++代码

#include <iostream>
#include <cmath>

using namespace std;

#define NUM 3

float num[NUM][NUM] = { 1,2,3,4,5,6,7,8,9 };

void Loop(float a[NUM][NUM], float u[NUM], int n)
{
	float S, U[NUM];
	int i, j;
	for (int i = 0; i <= n - 1; i++)
	{
		U[i] = u[i];
	}
	for (i = 0; i <= n - 1; i++)
	{
		S = 0.0;
		for (j = 0; j <= n - 1; j++)
		{
			S = S + a[i][j] * U[j];
		}
		u[i] = S;
	}
}

float Max(float u[NUM], int n)
{
	float max;
	int i;
	max = u[0];
	for (i = 0; i <= n - 1; i++)
	{
		if (u[i] > max)
		{
			max = u[i];
		}
	}
	return max;
}


//对矩阵进行转置操作
void MatrixTransport(float a[NUM][NUM],float b[NUM][NUM])
{
	for (int i = 0; i < NUM; i++)
		for (int j = 0; j < NUM; j++)
		{
			b[i][j] = a[j][i];
		}
}

void OutputMatrix(float a[NUM][NUM])
{
	for (int i = 0; i < NUM; i++)
	{
		for (int