Question

Hi! I am struggling trying to figure out how to do this.

For this lab, you must have two implementations of calculating the Fibonacci sequence. You are required to calculate it utilizing an array and then with a pointer. You must use the array provided and you must malloc space for your pointer. Your algorithms must be in-place, meaning they do not use a temporary variable to calculate the next sequence number. Lastly, you must insert a comment above each function describing if it is passed by reference or by value and why you believe it to be so.

For this lab, I also want to know what was difficult and what was easy. Functional Requirements:

-Your program must print from 0 to 89.

-You must have two functions, one function must take in an array as its parameter, the other must take in a pointer.

Non-Functional Requirements:

-Your algorithms to calculate the Fibonacci sequence must remain in-place, which means you must calculate the series without using a temp value.

-Your functions should be well documented, explaining what you are doing.

-You must have a header comment with your name, lab number and section number, email address, and a brief description of what the program does. starter code:

#include

void fib1(int a[]);

void fib2(int* a);

int main()

{

int arr[2];

int *pointer;

return 0;

}

Answer 1

#include <stdio.h>
void fib1(int a[])
{
a[0]=0;
a[1]=1;
int i=2;
while(a[i-1]<=89)
{
a[i]=a[i-1]+a[i-2];
i+=1;
}
i=0;
//This function print the elements of an array
printf("With array:-");
while(a[i]<=89)
{
printf("%d ",a[i]);
i+=1;
}
}
void fib2(int *a)
{
*a=0;
*(a+1)=1;
int i=2;
while(*(a+i)<=89)
{
*(a+i)=*(a+i-1)+*(a+i-2);
i+=1;
}
i=0;
//This function print the pointer array
printf("With pointer:-");
while(*(a+i)<=89)
{
printf("%d ",*(a+i));
i+=1;
}
}
int main()
{
int arr[20];
int *pointer=(int *)malloc(20*sizeof(int));
//Pass by reference because array is always pass its base address
fib1(arr);
printf("\n");
//Pass by Reference because pointer is pass its address
fib2(pointer);
return 0;
}