Your task for this week is to run the following code on your computer: public class...

Transcribed Image Text:

Your task for this week is to run the following code on your computer: public class Fibonacci { public static void main(String[] args). { for (int num = 0; num <100; num++) { } System.out.println(num + + fib(num)); public static long fib(int num) { if (num == 0 ) { return 0; //base case } if (num == 1) { return 1; //base case } //Recursive return fib(num 1) + fib(num - 2); - Instructions Contribute your initial post to our discussion by Thursday, 11:59 p.m. (but now is good!). In your post please include the following: 1. At what term does it take more than 5 minutes to print the output? 1 point 2. Write 1-2 paragraphs (100-120 words) on: 4 points 1. why at some point this program gets so slow? 2. What property should a recursive algorithm have to be effective? 3. Define a nonrecursive method using a loop and an array to implement the Fibonacci series. Copy your code to your reply. 3 points Your task for this week is to run the following code on your computer: public class Fibonacci { public static void main(String[] args). { for (int num = 0; num <100; num++) { } System.out.println(num + + fib(num)); public static long fib(int num) { if (num == 0 ) { return 0; //base case } if (num == 1) { return 1; //base case } //Recursive return fib(num 1) + fib(num - 2); - Instructions Contribute your initial post to our discussion by Thursday, 11:59 p.m. (but now is good!). In your post please include the following: 1. At what term does it take more than 5 minutes to print the output? 1 point 2. Write 1-2 paragraphs (100-120 words) on: 4 points 1. why at some point this program gets so slow? 2. What property should a recursive algorithm have to be effective? 3. Define a nonrecursive method using a loop and an array to implement the Fibonacci series. Copy your code to your reply. 3 points

Answer rating: 100% (QA)

Answer public class Fibonacci public static void mainStri... View the full answer