我从某处复制了strassen的算法,然后执行了它.这是输出
n = 256
classical took 360ms
strassen 1 took 33609ms
strassen2 took 1172ms
classical took 437ms
strassen 1 took 32891ms
strassen2 took 1156ms
classical took 266ms
strassen 1 took 27234ms
strassen2 took 734ms
strassen1动态方法在哪里,strassen2对于缓存而言classical是旧的矩阵乘法.这意味着我们古老而简单的经典之作是最好的.这是真的还是我错了？这是Java中的代码.
import java.util.Random;
class TestIntMatrixMultiplication {
public static void main (String...args) throws Exception {
final int n = args.length > 0 ? Integer.parseInt(args[0]) : 256;
final int seed = args.length > 1 ? Integer.parseInt(args[1]) : 256;
final Random random = new …