No matter what programming language you are learning, Fibonacci numbers calculation is just too classic to skip. It seems very easy to implement, but also can be deep enough to catch up with, especially when the number is super big. Have you thought that ever before?
It can be super easy to implement using recursion in just one line of code, even using Java.
int fib(int n) {
return n <= 2 ? 1 : (fib(n - 1) + fib(n - 2));
}And to make you understand the basic optimization idea, monetization mechanism will be introduced via an integer array or a HashMap, but the idea is same: calculate once and only once, so that those poor rabbits would feel life much easier.
Add just one more line of code and thanks to the Lambdas feature provided since JDK8, life is much easier nowadays.
private static Map<Integer, Integer> CACHE = new HashMap<>();
int fib(int n) {
return CACHE.computeIfAbsent(n, k -> (k <= 2 ? 1 : (fib(k - 1) + fib(k - 2))));
}There is always someone scared of the famous StackOverflowError, they would tell you not to use recursion but do an iterative way, like this:
int fib(int n) {
if (n <= 2) return 1;
int[] cache = new int[n];
cache[0] = cache[1] = 1;
for (int i = 2; i < n; i++) {
cache[i] = cache[i - 1] + cache[i - 2];
}
return cache[n - 1];
}Obviously, the integer array can be avoided, you can just keep three values and update them till the end, but that’s not the problem we want to discuss here. You would have probably found that it’s very easy for the result to be much bigger than the upper limit of int, long, double. For example, if we input n as 2048, what will be the exact result then?
454153044374378942504557144629068920270090826129364442895118239027897145250928343568434971 803477173043320774207501029966396250064078380187973638077418159157949680694899576625922604 895968605634843621876639428348247300097930657521757592440815188064651826480022197557589955 655164820646173515138267042115173436029259905997102292769397103720814141099147144935820441 85153918055170241694035610145547104337536614028338983073680262684101
It’s 4.54 * 10^427. As for Java, for this kind of problem, you have no other choice but BigInteger, and it’s very easy to use.
private static Map<Integer, BigInteger> CACHE = new HashMap<>();
BigInteger fib(int n) {
return CACHE.computeIfAbsent(n, k -> (k <= 2 ? BigInteger.ONE : (fib(k - 1).add(fib(k - 2)))));
}Congratulations! You will get a BOMB exploding like this:
Exception in thread "main" java.lang.StackOverflowError
at java.util.HashMap.hash(HashMap.java:339)
at java.util.HashMap.computeIfAbsent(HashMap.java:1099)You may use -Xss4m to shut it up, or resolve it in an iterative way a little bit optimized, wherein we won’t waste space to build an array. Yes, it’s right, recursion is easy to think of and implement, but it’s just too close to StackOverflowError.
BigInteger fib(int n) {
if (n <= 2) return BigInteger.ONE;
BigInteger prev = BigInteger.ONE, prevOfPrev = BigInteger.ONE;
BigInteger curr = null;
for (int i = 2; i < n; i++) {
curr = prev.add(prevOfPrev);
prevOfPrev = prev;
prev = curr;
}
return curr;
}BigInteger, what’s the secret behind it that it can represent a number beyond the upper limit of all primitive data types of Java?
The idea is still simple, but the implementation can be complex, especially when highly optimized is a must. bigint in Github would give you more information on how Timothy Buktu approaches and optimizes it.
There is a famous quote in The Lord of The Rings by Sam, “I can’t carry it for you, but I can carry you”, as for BigInteger, it seems should be “I can’t carry it for you, and I can’t carry you, but I can carry a segment of you.
Yes, the whole number is too big, but if we split it into many parts, then we will find each part might be within the upper limit, if we store each of them in an array, and perform the calculation in binary level, also handle the carrying part well, then a container to store a big number will be possible.
Pretty cool and smart, right? But what exactly is under the hood? Let’s check it out in the next post.
TO BE CONTINUED
Published on Java Code Geeks with permission by Nathanael Yang, partner at our JCG program. See the original article here: Fibonacci and BigInteger: Secret Under the Hood Opinions expressed by Java Code Geeks contributors are their own. |
It’s probably useless to fight this any longer, because the code just gets copy-pasted all over the place. This is the umpteenth blog entry I have seen that proliferates the same mistake. computeIfAbsent() will produce a livelock if used incorrectly in the way you have shown, for large enough n (n > 16). You have obviously not tested the code you have posted thoroughly enough.
Hi Sebastian, thank you so much for let me know the in-proper usage of computeIfAbsent here(originally I simply use it as syntax sugar to reduce line of code of showcase), would take a look into the things you mentioned here. The background of this post is actually for the 12 students I am currently teaching Java, just want them to test more inputs, especially when the input is relatively big, and some of them gave solutions like this https://github.com/ny83427/java-tutorial/blob/solution/chapter1/src/test/java/FibForBigNumber.java, as a result I want to simply explain the mechanism of BigInteger to them. Finally I want to say, honestly I… Read more »