Algorithms/FibonacciDynamic.java at master · pankajflows/Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
public class FibonacciDynamic{

     public static long fib(int n)
     {
         long f[] = new long[n+2];
         f[0] = 0;
         f[1] = 1;

         for(int i=2; i<=n; i++)
         {
             f[i] = f[i-1] + f[i-2];
         }


         return f[n];
     }
     public static void main(String []args)
     {
        int n = 1140000;
        //fib(n);
        System.out.println("Hello World : " + fib(n));
     }
}{

     public static long fib(int n)
     {
         long f[] = new long[n+2];
         f[0] = 0;
         f[1] = 1;

         for(int i=2; i<=n; i++)
         {
             f[i] = f[i-1] + f[i-2];
         }


         return f[n];
     }
     public static void main(String []args)
     {
        int n = 1140000;
        //fib(n);
        System.out.println("Hello World : " + fib(n));
     }
}