Question

Write a procedure that generates an array of Fibonacci numbers as its return value. The input to the procedure should be an integer n greater than or equal to two that specifies the desired size of the array. Here is how such a procedure would appear in a main():

int main() {

long* fibs;

fibs = make_fibs(10);

for (int k=0; k<10; k++) cout << fibs[k] << " ";

cout << endl;

return 0;

}

This code should produce the output: 1 1 2 3 5 8 13 21 34 55 In addition, there is a subtle bug in the main(). What i

Answer 1

//C++ program

#include<iostream>
using namespace std;

long* make_fibs(int n){
   long*arr = new long[n];
   arr[0]=1;
   if(n==1)return arr;
   arr[1]=1;
   if(n==2)return arr;
  
   for(int i=2;i<n;i++)arr[i] = arr[i-1] + arr[i-2];
  
   return arr;
}
int main() {

long* fibs;

fibs = make_fibs(10);

for (int k=0; k<10; k++) cout << fibs[k] << " ";

cout << endl;
return 0;
}

//sample output