H(n)=h(n)+h(n-2)
h(2)=h(1)=h(0)=1, n> =2
write a c++ function int h(int n)

#include<iostream>

using namespace std;

int h(int i)

{

if(i==0 ||i==1||i==2)

 return 1;

else

 return(h(i-1)+h(i-2));

}

int main()

{

int n, result;

cout<<"Enter value for n:";

cin>>n;

result = h(n);

cout<<result;

}

Explanation:

The recurrence relation will be h(n)= h(n-1)+h(n-2), unless the recursion will not finish.

yes you can very simple, click the heart and then click the follow requests button.

(because i need 20 chars)