Method f4

src/class098/Code02_BigShow.java:185–204

()

	// 用矩阵快速幂解决斐波那契第n项的问题
	public static void f4() {
		// 0  1  1  2  3  5  8 13 21 34...
		// 0  1  2  3  4  5  6  7  8  9
		int[][] start = { { 1, 0 } };
		int[][] m = {
				{ 1, 1 },
				{ 1, 0 }
				};
		int[][] a = multiply(start, power(m, 1));
		print(a);
		System.out.println("======");
		int[][] b = multiply(start, power(m, 2));
		print(b);
		System.out.println("======");
		int[][] c = multiply(start, power(m, 3));
		print(c);
		System.out.println("======");
		int[][] d = multiply(start, power(m, 4));
		print(d);
	}

}