Write an algorithm to generate the sum of the Fibonacci Numb
Solution
Input n=No of element in the series
Output Sum of series of n elements
Complexity O(nlogn)
Fibonacci(fib,n)
Fibonii series is like ..0 1 1 2 3 5 8 13 21 34 55 89

Input n=No of element in the series
Output Sum of series of n elements
Complexity O(nlogn)
Fibonacci(fib,n)
Fibonii series is like ..0 1 1 2 3 5 8 13 21 34 55 89
