Sum of Even Fibonacci numbers

Question

0.00/5 (No votes)

See more:

I got a challenge from www.hackerrank.com, calculate the sum of even Fibonacci number. I have submitted the logic that will calculate even Fibonacci numbers but i have used the loop to calculate the sum. Is there any mathematical logic that will calculate sum of even Fibonacci number without looping. Thanks in advance.

Posted 8-Oct-15 20:55pm

P Rohit Kumar

Add a Solution

Comments

Patrice T 9-Oct-15 4:10am

Show your code, it may be possible to optimize.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Answer 1 · 2015-10-08T21:42:00

No.
Well, that's not true, you could make it a recursive algorithm instead, but...that's even less efficient.

Fibonacci numbers are a sequence - each term depends on the two value of the two previous terms. So in order to evaluate F(n), you need to know both F(n-1) and F(n-2), both of which depend on two earlier terms.

So no, you can't magically find the value of F(n) without a loop being involved. Unless you use that loop to generate all the values in advance and store them for your app to access - but since the sequence is unbounded, you don;t have space for that...:laugh:

CPallini · Answer 2 · 2015-10-08T21:53:00

Since the Fibonacci series is easily generated with a loop, I wouldn't even bother if there are alternate algorithms (simplex sigillum veri). However you might try recursion. It is a pity the C# programming language doesn't support tail recursion optimization...Oops, wait... "Tail recursion in C#"[^].

Sum of Even Fibonacci numbers

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0