MCPcopy Create free account
hub / github.com/algorithmzuo/algorithm-journey / main

Method main

src/class098/Code02_BigShow.java:8–36  ·  view source on GitHub ↗
(String[] args)

Source from the content-addressed store, hash-verified

6public class Code02_BigShow {
7
8 public static void main(String[] args) {
9 System.out.println("f1() : ");
10 System.out.println("矩阵乘法展示开始");
11 f1();
12 System.out.println("矩阵乘法展示结束");
13 System.out.println();
14
15 System.out.println("f2() : ");
16 System.out.println("矩阵快速幂展示开始");
17 f2();
18 System.out.println("矩阵快速幂展示结束");
19 System.out.println();
20
21 System.out.println("f3() : ");
22 System.out.println("求斐波那契数列第n项");
23 System.out.println("用矩阵乘法解决");
24 System.out.println("展示开始");
25 f3();
26 System.out.println("展示结束");
27 System.out.println();
28
29 System.out.println("f4() : ");
30 System.out.println("求斐波那契数列第n项");
31 System.out.println("用矩阵快速幂解决");
32 System.out.println("展示开始");
33 f4();
34 System.out.println("展示结束");
35 System.out.println();
36 }
37
38 // 矩阵相乘
39 // a的列数一定要等于b的行数

Callers

nothing calls this directly

Calls 5

f1Method · 0.95
f2Method · 0.95
f3Method · 0.95
f4Method · 0.95
printlnMethod · 0.45

Tested by

no test coverage detected