Question

H(n)=h(n)+h(n-2)

h(2)=h(1)=h(0)=1, n>=2

Write a C++ function int h(int n)

Answer 1

#include<iostream>

using namespace std;

int h(int i)

int main()

{

int n, result;

cout<<"Enter value for n:";

cin>>n;

result = h(n);

cout<<result;

}

Step-by-step explanation:

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