index
| submit
| rank
| book

## fibonacci1 – The Fibonacci Sequence (easy version)

Write a program that computes a number in the fibonacci sequence.
This sequence is defined recursively as follows:

- F₀ = 0
- F₁ = 1
- Fₙ = Fₙ₋₁ + Fₙ₋₂

That is, the zeroth Fibonacci number is zero and the first Fibonacci number is one.
Other Fibonacci numbers are given by the sum of its two predecessors.

The first 10 numbers in the Fibonacci sequence are: 0, 1, 1, 2, 3, 5, 8, 13, 21 and 34.

### Input and output

Input will consist of a single integer *n*
indicating the position in the Fibonacci sequence.

Output should contain a single line
with a number *Fₙ*
indicating the Fibonacci number in position *n*.

#### Example input 1

```
3
```

#### Example output 1

```
2
```

#### Example input 2

```
8
```

#### Example output 2

```
21
```

#### The `fibonacci`

function

Your program should contain a `fibonacci`

function
that takes an integer and returns an integer.
Please refer to the information for your chosen language:

- C prototype:
`int fibonacci(int n)`

- Haskell type:
`fibonacci :: Int -> Int`

- Python definition:
`def fibonacci(n):`

- C++ prototype:
`int fibonacci(int n)`

For the purposes of this exercise you should not worry about performance.
Instead your should focus on correctness.
Implement your `fibonacci`

function in the most straightforward way possible.

### Scoring

- 2/12 works for the above examples albeit in an incorrect format
- 4/12 works for the above examples in the correct format
- 8/12 works for other examples
- 12/12 implements the
`fibonacci`

function

try first: power1

try next: hello2

index
| submit
| rank
| book

Copyright © 2020-2021 Rudy Matela

All rights reserved