What will be the recursive function/formula of count binary strings?

#1

What will be the recursive function/formula of count binary strings?

#2

Hey @ap8730390
BinryCount(n) = BinryCount(n - 1) +BinryCount(n - 2);

#3

Can you send me the recursive function for count binary strings? I am facing difficulty in solving recursively.

#4

public static long BinryCount(int n) {
if (n == 0 || n == 1) {
return n+1;
}
return BinryCount(n - 1) +BinryCount(n - 2);
}