MIDTERM - Pace University

The iterative program for Fibonacci(n) is available in ComC.java file. How it Works: Base Case 1: If value of int n = 0, it will return output as 0. Base Case 2: If value of int n = 1, it will return output as 1. Case 1: If value of int n = 2, it will calculate sum of two earlier terms and returns the output. e.g. Fibonacci(2) = 1. Fibonacci(100) = 354224848179261915075. Output Analysis: For ... ................
................