Write a recursive program that finds out ifn is a Fibonacci number or not. The Fibonacci numbers are 0 1 1 2 3 5 13 21 Your program should have the following interface: Enter a number (enter a negative number to quit): 14 !!!!! Sorry14 is not a Fibonacci number Enter a number (enter a negative number to quit): 13 Yes, you got it, 13 is a Fibonacci number Enter a number (enter a negative number to quit): 22 !!!!! Sorry 22 is not a Fibonacci number Enter a number (enter a negative number to quit): 23 !!!!! Sorry 23 is not a Fibonacci number Enter a number (enter a negative number to quit): 21 Yes, you got it, 21 is a Fibonacci number Enter a number (enter a negative number to quit): -1 (*Thanks Have a good Day*)

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
icon
Related questions
Question

I have the following code:

 

#include <iostream>

#include <cstdlib>

 

using namespace std;

 

//main method

 

int main()

 

{

 

    //variable declaration

 

        int num, num1 = 0, num2 = 1, temp;

 

        // getting input from user

 

       cout<<"Enter a number (enter a negative number to quit): ";

 

        cin>>num;

 

        //If the number entered by the user is negative then exit the program

 

        if (num<0)

 

        {

 

            //exit statement

 

            exit(0);

 

        }

 

        // 0 and 1 are fibonacci numbers

 

        if (num1==num || num2==num)

 

        {

 

                cout << num <<" is a fibonacci number\n";

 

                return 0;

 

        }

 

 

 

        // checking whether a given number is Fibonacci or not

 

        while (num2 <= num)

 

        {

 

            //assigning the value of the second number to a temp variable

 

                temp = num2;

 

                //assigning the sum value of num1 and num2 to num2

 

                num2 = num1 + num2;

 

                //assigning temp varible value to num1

 

                num1 = temp;

 

                //if num2 is equal to the number entered by the user

 

                if (num2 == num)

 

                {

 

                        break;

 

                }

 

        }

 

        // printing the results

 

        if (num1==num||num2==num)

 

        {

 

            //displaying a message to the user that entered number is a Fibonacci number

 

           cout<<"Yes, you got it, " <<num<< " is a Fibonacci number";     

 

        }

 

        else

 

        {

 

            //displaying a message to the user that the entered number is not a Fibonacci number

 

                cout<<"!!!!! Sorry "<<num <<" is not a Fibonacci number";

 

        }

 

        return 0;

  }

 

but I need it to output like exact attached image, where I can keep inputing numbers until it quits and can pleases how the recursive formula is determing FIB nums 

Write a recursive program that finds out ifn is a Fibonacci number or not. The Fibonacci
numbers are
0 1 1
2
3
5
13
21
Your program should have the following interface:
Enter a number (enter a negative number to quit): 14
!!!!! Sorry14 is not a Fibonacci number
Enter a number (enter a negative number to quit): 13
Yes, you got it, 13 is a Fibonacci number
Enter a number (enter a negative number to quit): 22
!!!!! Sorry 22 is not a Fibonacci number
Enter a number (enter a negative number to quit): 23
!!!!! Sorry 23 is not a Fibonacci number
Enter a number (enter a negative number to quit): 21
Yes, you got it, 21 is a Fibonacci number
Enter a number (enter a negative number to quit): -1
(*Thanks Have a good Day*)
Transcribed Image Text:Write a recursive program that finds out ifn is a Fibonacci number or not. The Fibonacci numbers are 0 1 1 2 3 5 13 21 Your program should have the following interface: Enter a number (enter a negative number to quit): 14 !!!!! Sorry14 is not a Fibonacci number Enter a number (enter a negative number to quit): 13 Yes, you got it, 13 is a Fibonacci number Enter a number (enter a negative number to quit): 22 !!!!! Sorry 22 is not a Fibonacci number Enter a number (enter a negative number to quit): 23 !!!!! Sorry 23 is not a Fibonacci number Enter a number (enter a negative number to quit): 21 Yes, you got it, 21 is a Fibonacci number Enter a number (enter a negative number to quit): -1 (*Thanks Have a good Day*)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Function Arguments
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education