it is video no 6 of deep diving into recursion.why Kartik sir has taken 2 cases when n==1.
#include
using namespace std;
int count(int n,int ld){
if(n==0){
return 0;
}
if(n==1){
if(ld==0){
return 2;
}
if(ld==1){
return 1;
}
}
if(ld==0){
return count(n-1,1)+count(n-1,0);
}
if(ld==1){
return count(n-1,0);
}
}
int main(){
int n;
cin>>n;
cout<<count(n,0)<<endl;
}
it is the code
