What should be the base condition for the below recursive code?
int fib(int n) { //Base condition return fib(n - 1) + fib(n - 2); }
if(n>=1) return 0;
if(n<=1) return 0;
if(n< 1 ) return n;
if(n<=1) return n;
This question is part of this quiz :
Quiz on Fibonacci Numbers