Given a positive integer N, the task is to find the nearest Fibonacci number to the given integer N. If there are two Fibonacci Numbers having same difference from N, then print the smaller value.
Examples:
Input: N = 20
Output: 21
Explanation: Nearest Fibonacci number to 20 is 21.
Input: N = 17
Output: 13
Approach: Follow the steps below to solve the problem:
- If N is equal to 0, then print 0 as the result.
- Initialize a variable, say ans, to store the Fibonacci Number nearest to N.
- Initialize two variables, say First as 0, and Second as 1, to store the first and second terms of the Fibonacci Series.
- Store the sum of First and Second in a variable, say Third.
- Iterate until the value of Third is at most N and perform the following steps:
- Update the value of First to Second and Second to Third.
- Store the sum of First and Second in the variable Third.
- If the absolute difference of Second and N is at most the value of Third and N, then update the value of ans as Second.
- Otherwise, update the value of ans as Third.
- After completing the above steps, print the value of ans as the result.
Below is the implementation of the above approach:
Time Complexity: O(log N)
Auxiliary Space: O(1)
