Question

CMPS 290 Programming Assignment Arrays and Recursion – Fibonacci Numbers In this programming assignment you will be working with arrays and multiple function calls, including a recursive function call. The goal of the assignment will be to, using a pre-set array of sequence numbers, calculate the Fibonacci sequence number for each value in the array (see the example at the bottom if this isn’t clear).

Instructions and Requirements:

• Create a program that assembles and runs to find the correct output.

• Name your program arrayFibYourLastName.asm.

• Your program must use recursion to solve for the Fibonacci sequence.

• You will use the data segment to define your array and print statements.

• Your “main” will only be used to send items into your function(s) and to print prompts and results.

• You will need one function to traverse your array and then inside of it call your recursive Fibonacci function.

• Your results should be stored to a second array that you will then print out of. • You must make use of the stackpointer to store the values that you will need across function calls and for any saved values registers.

• We will assume Fibonacci(0) is 0 and Fibonacci(1) is 1.

Hints:

• You will use the .word directive in the data segment to define your input array as word values (see the example from class).

• You will also define .space in order to hold your results. • Remember we are working with words, not bytes, and how that affects your offset pointer.

• Keeping up with the size of your array, which you know since you are pre-defining it, will be important.

• Keeping up with your stack and which values you are placing onto it will be important!

• When working, break it up into pieces and solve them individually instead of taking on the whole problem at once. I recommend starting by printing your main array, then copying that into the result array and printing that, then do the copying in a function, then change the values in the result array in the function, then start work on the fibonacci function. Break everything down into individual, manageable sections so you aren’t trying to take on too much at once.

• As always, start early and ask questions if you are stuck, having trouble, or don’t understand something.

Submission:

• Turn in your completed assignment to Moodle. You must fully submit your assignment, not leave it as a draft. Make sure you are finished with your assignment and that the correct file is uploaded before fully submitting it. If you have made a mistake, let me know and I can revert your submission to a draft, so you can make a correct before the due date. The due date can be found on Moodle.

Sample Output:

(Note: The array used in my program was 1, 2, 5, 8, 12, 15 as seen in the Sequence Number column)

This program will calculate out the Fibonacci number at a given sequence position.

The positions will be provided by an array hardcoded into the program.

Output shown below as:

Sequence Number: Fibonacci Number

1: 1

2: 1

5: 5

8: 21

12: 144

15: 610

-- program is finished running –

“High Level” Example Code (Does not include the “main”): //arrayFib takes in an int array of values to find the Fibonacci number of. //It also takes in a second array to store the results into, and the size of each array. //Assume the size of both are the same. //It then calls the Fib(n) function with the current value from the array as n. //After the result is calculated, it is stored in the result array, i is increased, and // if we have more values we repeat the process. arrayFib(int[] array, int[] resultArray, int size){ int i = 0; while(i < size){ int n = array[i]; resultArray[i] = Fib(n); i+=1; } } //Recursively calculate the fibonacci number for the argument n passed in. //If n is 0, then the fibonacci number is 0. //If n is 2 or less, then the fibonacci number is 1. //Else calculate the value by calling the Fib function with n-1 and then // adding that result to a second call to the function with n-2. Fib(int n){ if(n == 0) return 0; if(n == 1 || n == 2) return 1; else return Fib(n-1) + Fib(n-2); }

Answer 1

Code-

#include <stdio.h>
int fib(int n) // recursive programm for finding the resultant Fibonacci Number in Nth position
{
if (n <= 1)
return n;
return fib(n - 1) + fib(n - 2);
}
int main() {
   //code
   int arrayFib[]={ 1, 2, 5, 8, 12, 15}; // predefind array elements
   int s=sizeof(arrayFib)/sizeof(arrayFib[0]); // size of arrayFibrr
  
   int arr[s];
   for(int i=0;i<s;i++)
   {
   arr[i]=fib(arrayFib[i]); // storing the resultant number in arr
   }
   for(int i=0;i<s;i++)
   {
   printf("%d:%d\n",arrayFib[i],arr[i]); // printing the resulatant array in required format
   }
   return 0;
}

Output-

1:1
2:1
5:5
8:21
12:144
15:610

Note:- Hope you got some idea after this article.