Algorithm for fibonacci sequence

[5ymmetrica1]

Homework Statement

create an algorithm for a Fibonacci sequence that will return the f value in f(n) = f(n-1)+f(n-2)

Homework Equations

f(n) = f(n-1)+f(n-2)

The Attempt at a Solution

I have tried several ways to create an algorithm that will sum the two previous numbers but always end up with the sequence 0,1,1,2,4,8,16 so the numbers end up double.

please keep in mind I have only just started my intro to programming course and am just learning to write algorithms, I have no experience with programming languages at the present time.

I've got something like this

1 function fibonacci(a,b)
2 if n=0,
3 a<- 0
4 b<- 1
5 print a
6 if n=1
7 a<- (a+b) = (1+0) = 1
8 print a
9 if n=2
10 b<- a = 1
11 a<- (a+b) = (1+1) =2
12 print abut as you can see, continuing on this path with only double the value each time. I need to find a way to sum numbers, depending on the value 'n' but can't seem to think of how to do this.

any help is greatly appreciated.

 

[Adithyan]

I see that you need to learn more about recursive functions. Here, this will help you out:
https://www.khanacademy.org/science/computer-science-subject/computer-science/v/recursive-fibonacci-example