1. import java.util.

Scanner;
2. class fib{
3. long fib_recursive(int n){
4. if(n<=1)
5. return n;
6. else
7. return fib_recursive(n-1)+fib_recursive(n-2);}
8. long fib_interative(int n){
9. int i;
10. long x = 0, y = 1, z = 1;
11. for (i = 0; i < n; i++) {
12. x = y;
13. y = z;
14. z = x + y; }
15. return x; } }
16. class matrixmulti{
17. void matrixmult(int n){
18. int i,j,k;
19. int[][] a=new int[n][n];
20. int[][] b=new int[n][n];
21. int[][] c=new int[n][n];
22. for(i=0;i<=n-1;i++)
23. for(j=0;j<=n-1;j++){
24. a[i][j]=1;
25. b[i][j]=1; }
26. for(i=0;i<=n-1;i++)
27. for(j=0;j<=n-1;j++){
28. c[i][j]=0;
29. for(k=0;k<=n-1;k++){
30. c[i][j]+=a[i][k]*b[k][j]; } }
31. for(i=0;i<=n-1;i++)
32. for(j=0;j<=n-1;j++){
33. System.out.println("c["+i+"]["+j+"]="+c[i][j]); } } }
34. public class algorithm{
35. public static void main(String[] argv){
36. int m,f,c;
37. fib my_fib=new fib();
38. matrixmulti my_matrix=new matrixmulti();
39. System.out.println("enter the case:1.matrixmultiplication 2.fibonac
ci");
40. Scanner choose=new Scanner(System.in);
41. c=choose.nextInt();
 42. switch(c){
43. case 1:
44. /*matrixmult*/
45. Scanner scanner_matrixmult=new Scanner(System.in);
46. System.out.println("enter an integer(matrixmult):");
47. m=scanner_matrixmult.nextInt();
48. long starttime_matrix=System.nanoTime();
49. my_matrix.matrixmult(m);
50. long endtime_matrix=System.nanoTime();
51. System.out.println("matrixmultiplication_time:"+(endtime_ma
trix-starttime_matrix)/1000000000);
52. break;
53. case 2:
54. /*fib_recursive*/
55. Scanner scanner_fib=new Scanner(System.in);
56. System.out.println("enter an interger(fib):");
57. f=scanner_fib.nextInt();
58. double starttime_rec=System.nanoTime();
59. System.out.println(my_fib.fib_recursive(f));
60. double endtime_rec=System.nanoTime();;
61. System.out.println("fib_recursive_time:"+(endtime_rec-
starttime_rec)/1000000000);
62. /*fib_interative*/
63. double starttime_interative=System.nanoTime();
64. System.out.println(my_fib.fib_interative(f));
65. double endtime_interative=System.nanoTime();
66. System.out.println("fib_interative_time"+(endtime_interativ
e-starttime_interative)/1000000000);
67. break;} } }

Mutrux Mutiplication