Question

CH Question 1. Implement a recursive method fibo that takes an integer num as a parameter and returns the nth Fibonacci number. Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, ... is an infinite sequence, where first 2 numbers are 1 and every subsequent number is equivalent to the sum of the previous two. Question 2. Implement a recursive method mult that takes two positive integer parameters, x and y and returns their product For example mult(2,3) returns 6. Question 3. Embed the functions above in a main program and test them for, both, base and general cases.

Answer 1

#include <iostream>

using namespace std;

// recursive method to find the nth fibonacci number

// input is the number n

// output is the nth fibonacci number

int fibo(int n) {

    // base case

    if (n == 1 || n == 2) {

        return 1;

    }

    // recursive call

    return (fibo(n-1) + fibo(n-2));

}

// mult function to return the multiplication of two numbers using recursion

// input is two integers

// output is product of two input numbers

int mult(int a, int b) {

    // base case

    if (b == 0) {

        return 0;

    }

    // recursive call

    return a + mult(a, b-1);

}

// main function

int main() {

    // test input

    int n = 6;

    int a = 3, b = 5;

    // display the results and test calls

    cout << n << "th fibonacci number: " << fibo(n) << endl;

    cout << a << " * " << b << " = " << mult(a, b) << endl;

    return 0;

}

- /main 6th fibonacci number: 8 3 + 5 = 15

for help please comment.
thank you.