News
int fib(int n ) { //this function will return the ith fibonacci number ...
multiplication of size 2 by 2. And on the other hand complexity of bruteforce solution is O(n).
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback