Question: Hi can you provide the big o notation for the code below and some explanation public BigInteger bigFastFib(int i, BigInteger one, BigInteger two) { if
Hi can you provide the big o notation for the code below and some explanation
public BigInteger bigFastFib(int i, BigInteger one, BigInteger two) { if (i<=n){ return one; //base case
}else { return bigFastFib(++i, first.add(two), one);
//recursive case
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
