Skip to main content
added memoization tag
Link
mleyfman
  • 5.3k
  • 1
  • 25
  • 48
Tweeted twitter.com/#!/StackCodeReview/status/491468387634384896
deleted 170 characters in body; edited tags; edited title
Source Link
Jamal
  • 35.2k
  • 13
  • 134
  • 238

Fibonnaci Dynamic Proramming : Can this be improvedprogramming with Fibonacci

I have written the following code using a dynamic programming technique, can i. Can I use ArrayList here .PleaseArrayList here? Please let me know if iI can improve this code.

package com.java.fib; import java.math.BigInteger; import java.util.HashMap; public class Fibonaci { public static void main(String[] args) { System.out.println(" number "); long startTime = System.currentTimeMillis(); HashMap memoized = new HashMap(); fibonanci(220, memoized); System.out.println(" Total Time " + (System.currentTimeMillis() - startTime)); } private static BigInteger fibonanci(int n, HashMap memoized) { if (memoized.containsKey(n)) { return memoized.get(n); } if (n
package com.java.fib;

import java.math.BigInteger;
import java.util.HashMap;

public class Fibonaci {

    public static void main(String[] args) {
        System.out.println(" number ");
        long startTime = System.currentTimeMillis();
        HashMap<Integer, BigInteger> memoized = new HashMap<Integer, BigInteger>();
         fibonanci(220, memoized);
        System.out.println(" Total Time "
                + (System.currentTimeMillis() - startTime));
    }

    private static BigInteger fibonanci(int n, HashMap<Integer, BigInteger> memoized) {
        if (memoized.containsKey(n)) {
            return memoized.get(n);
        }
        if (n <= 0) {
             return BigInteger.ZERO;
        }
        if (n <= 2) {
            return BigInteger.ONE;
        } else {
            BigInteger  febonani = fibonanci(n - 1, memoized).add (fibonanci(n - 2, memoized));
            System.out.println(" febonani " + febonani);
                memoized.put(n, febonani);
            return febonani;
        }
    }
}

Fibonnaci Dynamic Proramming : Can this be improved

I have written following code using dynamic programming technique, can i use ArrayList here .Please let me know if i can improve this code.

package com.java.fib; import java.math.BigInteger; import java.util.HashMap; public class Fibonaci { public static void main(String[] args) { System.out.println(" number "); long startTime = System.currentTimeMillis(); HashMap memoized = new HashMap(); fibonanci(220, memoized); System.out.println(" Total Time " + (System.currentTimeMillis() - startTime)); } private static BigInteger fibonanci(int n, HashMap memoized) { if (memoized.containsKey(n)) { return memoized.get(n); } if (n

Dynamic programming with Fibonacci

I have written the following code using a dynamic programming technique. Can I use ArrayList here? Please let me know if I can improve this code.

package com.java.fib;

import java.math.BigInteger;
import java.util.HashMap;

public class Fibonaci {

    public static void main(String[] args) {
        System.out.println(" number ");
        long startTime = System.currentTimeMillis();
        HashMap<Integer, BigInteger> memoized = new HashMap<Integer, BigInteger>();
         fibonanci(220, memoized);
        System.out.println(" Total Time "
                + (System.currentTimeMillis() - startTime));
    }

    private static BigInteger fibonanci(int n, HashMap<Integer, BigInteger> memoized) {
        if (memoized.containsKey(n)) {
            return memoized.get(n);
        }
        if (n <= 0) {
             return BigInteger.ZERO;
        }
        if (n <= 2) {
            return BigInteger.ONE;
        } else {
            BigInteger  febonani = fibonanci(n - 1, memoized).add (fibonanci(n - 2, memoized));
            System.out.println(" febonani " + febonani);
                memoized.put(n, febonani);
            return febonani;
        }
    }
}
Source Link
VIckyb
  • 675
  • 1
  • 10
  • 18

Fibonnaci Dynamic Proramming : Can this be improved

I have written following code using dynamic programming technique, can i use ArrayList here .Please let me know if i can improve this code.

package com.java.fib; import java.math.BigInteger; import java.util.HashMap; public class Fibonaci { public static void main(String[] args) { System.out.println(" number "); long startTime = System.currentTimeMillis(); HashMap memoized = new HashMap(); fibonanci(220, memoized); System.out.println(" Total Time " + (System.currentTimeMillis() - startTime)); } private static BigInteger fibonanci(int n, HashMap memoized) { if (memoized.containsKey(n)) { return memoized.get(n); } if (n