Question

In C



Code provided:

The nth term in a sequence of numbers called recursive_sequence can be defined as follows: • recursive_sequence(0) = 0 • recursive_sequence(1) = 1 If n is greater than 1, then recursive_sequence(n) = 2* recursive_sequence(n - 2) + recursive_sequence(n-1) The first 6 terms in this sequence are: 0,1, 1, 3, 5, 11 Complete the C program below by implementing the recursive_sequence() function. The function takes one parameter - an integer value n. The recursive_sequence () function must be defined recursively. You may not use a loop. For example: Input Result 5 recursive_sequence (5) = 11 7 recursive_sequence (7) = 43

#include <stdio.h>

int recursive_sequence(int n)
{
//type your code here
}

int main()
{
int number;
scanf("%d", &number);
printf("recursive_sequence(%d) = %d",number, recursive_sequence(number));
return 0;
}

Answer 1

#include <stdio.h>

int recursive_sequence(int n){
    if(n==0){
        return 0;
    }
    else if(n==1){
        return 1;
    }
    else{
        return 2*recursive_sequence(n-2) + recursive_sequence(n-1);
    }
}

int main()
{
    int number;
    scanf("%d", &number);
    printf("recursive_sequence(%d) = %d",number, recursive_sequence(number));

    return 0;
}

$\color{blue}\underline{Output:}$

л recursive_sequence (5) = 11

Note: Please comment below if you have any doubts. upuote the solution if it helped. Thanks!