Opus5.Experiment1

Explanation

This program measures the running times two methods that compute the Fibonacci numbers. One method is recursive method the other non-recursive is not.

The source code for the main method is available here.

Instructions

This is a non-interactive program that computes the first 47 Fibonnacci numbers. The output consists of n, the time in seconds required to compute F_n iteratively, and the time in seconds required to compute F_n recursively.