Reference no: EM133777083

Problem: Algorithms & Data Structures

Analyze the factorial and Fibonacci algorithms:

Part I:

Develop an excel spreadsheet that charts the theoretical cost for each of the four routines (C program - factorial, recursive factorial, Fibonacci, recursive Fibonacci). The spreadsheet MUST have a sheet for each and the sheets MUST be in this order: factorial, recursive factorial, Fibonacci, recursive Fibonacci. For each sort routine you MUST also include a chart (see below). The chart colors MUST be red for factorial, orange for recursive factorial, green for Fibonacci, and blue for recursive Fibonacci (T(n) = c2*n + c1).

Part II:

Add to the spreadsheet the actual run-times for each routine using the same values of N as used in part I. You will most likely have to adjust your loop to get run-times similar to the theoretical values (which is OK as all we want to know is how does the actual code compare with the theory). You can use the same code for both recursive Fibonacci charts.