Question

Extra Credit - Fibonacci Function (Lec. 5 topic: Recursive function and runtime stack. Use recursion to calculate the Fibonacci Function 1.) Use a recursive function called fib() to calculate the Fibonacci Function for the following values for the variable n. int n = 10; int n = 20; int n = 30; int n = 40; int n = 45; int n = 46; 2.) In addition to calculating and displaying the results, use a "timer" to see how long it takes to evaluate and display the answer. - A "timer" is C++ code that gets the starting time from the computer before the function begins. Then the timer gets the ending time, right after the function has finished. The starting time and ending time are stored in variables (start and end). The timer then subtracts the starting time from the ending time and comes up with the number of cpu clock ticks it took to do the problem. Then the timer divides the number of clock ticks by a predefined constant (CLK_TCK) which converts the number of clock ticks into seconds. In other words, the program can execute the function, display the numerical answer, and display how long it took to execute. #include <iostream> Here is the entire program. #include <ctime> using namespace std; long long int fib(int n); int main() clock_t is a predefine class. int n = 20; clock_t start; clock_t end; start and end are class objects. clock() is a predefined function that returns the system time, which is then assigned to start and end). start = clock(); cout << "fib" << n << ") = " << fib(n); end = clock ; cout << "\t\tTime = " < (end - start) / CLK_TCK << "seconds. \n\n"; clock_t and clock() are defined in <ctime>, so this header must be included. system("pause"); return; long long int fib(int n) // Base case (stops recursion) if (n == 1 Il n == 2) return 1; return fib(n - 1) + fib(n - 2);

Answer 1

// I am answring only 1 and 3 questions
// PLEASE REPOST RMANING QUESTION
// THANK YOU

// // / I am awwwww only 1 and questions PLEASE REPOST RMANING QUESTION THANK YOU #include<stdio.h> int fib(int num) if (num == 0 || num == 1) { return num; else { // recursive call return fib (num-1) + fib (num-2); } main() int i, num; printf("Enter number : "); scanf("%d", &num); printf("\nfibonacci Sequence for $d is: ", num); for(i=0; i<num; i++) printf("id", fib(i));

I E:\programs_c\main\feb.exe Enter number : 10 fibonacci Sequence for 10 is: @ 1 1 2 3 5 8 13 21 34 Process returned 10 COXA execution time : 2.598 S Press any key to continue.

E:\programs_c\main\feb.exe Enter number : 20 fibonacci Sequence for 20 is: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1 597 2584 4181 Process returned 20 (@x14> execution time : 4.678 S Press any key to continue.

E:\programs_c\main\feb.exe - x Enter number : 30 fibonacci Sequence for 30 is : 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1 3 597 2584 4181 6265 10946 17711 28657 46368 75025 121393 196418 317811 514229 Process returned 30 (Øx1E) execution time : 18.281 s Press any key to continue.

I E:\programs_c\main\feb.exe Enter number : 40 I fibonacci Sequence for 40 is : 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 619 982 1 597 2584 4181 6765 10946 17711 2865746368 75025 121393 196418 317811 514229 832 949 1346269 2178309 3524578 5702887_9227465 14930352 24157817 39088169 63245986 execution time : 6.457 si Process returned 40 (0x28) Press any key to continue. forl= num. it)

E:\programs_c\main\feb.exe Enter number : 45 fibonacci Sequence for 45 is: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 372 619 987 1E 597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832 040 1346269 2178309 3524578 5702887 9227465 14930352 24157817 39088169 63245986 102334155 165580141 267914296 433494437 201408733 Process returned 45 (0x2D) execution time : 20.550 S Press any key to continue.

E:\programs_c\main\feb.exe Enter number : 46 1123358820231 1 2 19 19 39438169 fibonacci Sequence for 46 is: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 619 982 1 592 2584 4181 6765 10946 17711 28657_46368 75025 121393 196418 317811 514229 832 649 1346269 2178309 3524578 5202887_9227465 14930352 24157817 39088169 632459861 102334155 165580141 267914296_433494437 701408733 1134903170 Process returned 46 (0x2E> execution time : 32.302 si Press any key to continue.

3. Question Time in Seconds. Fibonacci Number fib(num) 10 20 30 40 45 2.598 s 4.678 s 18.678 s 6.457 s 20.550 s 32.302 s 46