public class Matrix {
private int N = 4039;
private int[][] A;
public Matrix() {
}
//STRASSEN矩阵算法
//常量N用来定义矩阵的大小
public int[][] doMatrixMultiply(int[][] A, int[][] B) {
int[][] C = new int[4039][4039];
STRASSEN(N, A, B, C); //调用STRASSEN函数计算
return C;
}
private void MATRIX_MULTIPLY(int[][] A, int[][] B, int[][] C) {
int i, j, t;
for (i = 0; i < 2; i++) //计算A*B-->C
{
for (j = 0; j < 2; j++) {
C[i][j] = 0; //计算完一个C[i][j]，C[i][j]应重新赋值为零
for (t = 0; t < 2; t++) {
C[i][j] = C[i][j] + A[i][t] * B[t][j];
}
}
}
}
private void MATRIX_ADD(int n, int[][] X, int[][] Y, int[][] Z) //矩阵加法函数X+Y—>Z
{
int i, j;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
Z[i][j] = X[i][j] + Y[i][j];
}
}
}
private void MATRIX_SUB(int n, int[][] X, int[][] Y, int[][] Z) //矩阵减法函数X-Y—>Z
{
int i, j;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
Z[i][j] = X[i][j] - Y[i][j];
}
}
}
private void STRASSEN(int n, int[][] A, int[][] B, int[][] C) //STRASSEN函数（递归）
{
int[][] A11 = new int[4039][4039];
int[][] A12 = new int[4039][4039];
int[][] A21 = new int[4039][4039];
int[][] A22 = new int[4039][4039];
int[][] B11 = new int[4039][4039];
int[][] B12 = new int[4039][4039];
int[][] B21 = new int[4039][4039];
int[][] B22 = new int[4039][4039];
int[][] C11 = new int[4039][4039];
int[][] C12 = new int[4039][4039];
int[][] C21 = new int[4039][4039];
int[][] C22 = new int[4039][4039];
int[][] M1 = new int[4039][4039];
int[][] M2 = new int[4039][4039];
int[][] M3 = new int[4039][4039];
int[][] M4 = new int[4039][4039];
int[][] M5 = new int[4039][4039];
int[][] M6 = new int[4039][4039];
int[][] M7 = new int[4039][4039];
int[][] AA = new int[4039][4039];
int[][] BB = new int[4039][4039];
int[][] MM1 = new int[4039][4039];
int[][] MM2 = new int[4039][4039];
int i, j;//,x;
if (n == 2) {
MATRIX_MULTIPLY(A, B, C);//按通常的矩阵乘法计算C=AB的子算法(仅做2阶)
} else {
for (i = 0; i < n / 2; i++) //////////
{
for (j = 0; j < n / 2; j++) {
A11[i][j] = A[i][j];
A12[i][j] = A[i][j + n / 2];
A21[i][j] = A[i + n / 2][j];
A22[i][j] = A[i + n / 2][j + n / 2];
B11[i][j] = B[i][j];
B12[i][j] = B[i][j + n / 2];
B21[i][j] = B[i + n / 2][j];
B22[i][j] = B[i + n / 2][j + n / 2];
} //将矩阵A和B式分为四块
}
MATRIX_SUB(n / 2, B12, B22, BB); //////////
STRASSEN(n / 2, A11, BB, M1);//M1=A11(B12-B22)
MATRIX_ADD(n / 2, A11, A12, AA);
STRASSEN(n / 2, AA, B22, M2);//M2=(A11+A12)B22
MATRIX_ADD(n / 2, A21, A22, AA);
STRASSEN(n / 2, AA, B11, M3);//M3=(A21+A22)B11
MATRIX_SUB(n / 2, B21, B11, BB);
STRASSEN(n / 2, A22, BB, M4);//M4=A22(B21-B11)
MATRIX_ADD(n / 2, A11, A22, AA);
MATRIX_ADD(n / 2, B11, B22, BB);
STRASSEN(n / 2, AA, BB, M5);//M5=(A11+A22)(B11+B22)
MATRIX_SUB(n / 2, A12, A22, AA);
MATRIX_SUB(n / 2, B21, B22, BB);
STRASSEN(n / 2, AA, BB, M6);//M6=(A12-A22)(B21+B22)
MATRIX_SUB(n / 2, A11, A21, AA);
MATRIX_SUB(n / 2, B11, B12, BB);
STRASSEN(n / 2, AA, BB, M7);//M7=(A11-A21)(B11+B12)
//计算M1,M2,M3,M4,M5,M6,M7（递归部分）
MATRIX_ADD(N / 2, M5, M4, MM1); //////////
MATRIX_SUB(N / 2, M2, M6, MM2);
MATRIX_SUB(N / 2, MM1, MM2, C11);//C11=M5+M4-M2+M6
MATRIX_ADD(N / 2, M1, M2, C12);//C12=M1+M2
MATRIX_ADD(N / 2, M3, M4, C21);//C21=M3+M4
MATRIX_ADD(N / 2, M5, M1, MM1);
MATRIX_ADD(N / 2, M3, M7, MM2);
MATRIX_SUB(N / 2, MM1, MM2, C22);//C22=M5+M1-M3-M7
for (i = 0; i < n / 2; i++) {
for (j = 0; j < n / 2; j++) {
C[i][j] = C11[i][j];
C[i][j + n / 2] = C12[i][j];
C[i + n / 2][j] = C21[i][j];
C[i + n / 2][j + n / 2] = C22[i][j];
}
}
}
}
}

这是c么？

这是c么？