Print Fibonacci Series

Create a generator function ‘generatorFunction’, which takes the number of Fibonacci numbers to return (say this is ‘n’). In this function, create a variable ‘count’ initially assigned to one. Create two more variables, ‘a’ and ‘b’, each assigned to 0 and 1, respectively. Now, use a while loop on ‘count’ variable from ‘1’ to’ ‘n’. In each iteration, first, yield ‘a’ and then assign ‘b’ to ‘a’ and ‘a + b’ to ‘b’.

Now, create an empty list, iterate over the ‘generator’ object and insert the items in the list. And Finally, return the list.
 

The steps are as follows:-
 

// Generator function to generate Fibonacci numbers

function generatorFunction(int n):

1. Initialize a variable ‘count’, which is initially assigned to 1.
2. Initialize two more variables, ‘a’ and ‘b’, each assigned to 0 and 1, respectively.
3. While count <= n:
   • yield a.
   • Assign ‘b’ to ‘a’ and ‘a + b’ to ‘b’.
   • Increment count.

// Function to generate first n Fibonacci numbers

function generateFibonacciNumbers(int n):

1. Create an empty list, ‘listOfIntegers’, which stores the Fibonacci Numbers.
2. Iterate over each item produced by generatorFunction(n):
   • Insert the value in the list ‘listOfIntegers’.
3. Return ‘listOfIntegers’.

O( n ), where n is the given number.

We iterate for n times using the while loop,

Hence the time complexity is O( n ).

O( n ), where n is the given number.
 

We store the series in a list, and it will store N elements,
 

Hence the space complexity is O( n ).