is it correct ?Write a recursive function that returns the nth number in a fibonacci sequence when n is passed to function. The fibonacci sequence is like 0,1,1,2,3,5,8,13......Answer:#include <iostream> using namespace std; int getFibonacci(int n) { if (n == 0 || n == 1) return n; else return getFibonacci(n - 1) + getFibonacci(n - 2);} int main() { int n = 7; int result = getFibonacci(n); cout << result;}

Here in this question we have given a code of Fibonacci sequence and we have asked to check weather…

Answered: is it correct ? Write a recursive…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

is it correct ?

Write a recursive function that returns the nth number in a fibonacci sequence when n is passed to function. The fibonacci sequence is like 0,1,1,2,3,5,8,13......

Answer:

#include <iostream>

using namespace std;

int getFibonacci(int n) {

if (n == 0 || n == 1)

return n;

else

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

}

int main() {

int n = 7;

int result = getFibonacci(n);

cout << result;

}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions