Answer to Question #243214 in C++ for Sally

Question

Problem 4: Fibonacci Series always starts with 0 and 1, or in other words the first two terms of this series are 0 and 1. Next term in this series is found by adding two previous numbers. Following figure shows first 6 terms of the Fibonacci Series i.e. 0, 1, 1, 2, 3, 5, if we were to print only even numbers then the output will be 0, 2.

Design the algorithm (pseudocode) for a program that prints even terms in Fibonacci series less than N. Where N is the number entered by the user. For example,

If N is 75 then print 0, 2, 8, 34 (i.e. all even terms in Fibonacci series that are less than 20)

If N is 20 then print 0, 2, 8 (i.e. all even terms in Fibonacci series that are less than 20)

If N is 6 then print 0, 2 (i.e. all even terms in Fibonacci series that are less than 6)

Answer 1

#include <iostream>
using namespace std;
void Fib(int N){
    int arr[2] = {0, 1};
    int next = 1;
    while(next < N){
        if(!(arr[0] % 2)) cout<<arr[0]<<", ";
        next = arr[0] + arr[1];
        arr[0] = arr[1];
        arr[1] = next;
    }
}
int main(){
    cout<<"Enter N: ";
    int N; cin>>N;
    Fib(N);
    return 0;
}