-
Notifications
You must be signed in to change notification settings - Fork 0
/
ft_fibonacci.c
40 lines (36 loc) · 1.42 KB
/
ft_fibonacci.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_fibonacci.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: dalves-p <dalves-p@student.42sp.org.br> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/04/15 18:27:24 by dalves-p #+# #+# */
/* Updated: 2021/06/29 18:37:22 by dalves-p ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
/*
** LIBRARY: N/A
** DESCRIPTION:
** The ft_fibonacci() function returns the n-th element of the Fibonacci
** sequence, the first element being at the 0 index. It considers that Fibonacci
** sequence starts like 0,1,1,2. If the index is less than 0, the function should
** return -1.
*/
int ft_fibonacci(int index)
{
int result;
result = 0;
if (index < 0)
return (-1);
if (index == 0)
return (0);
if (index == 1)
return (1);
if (index > 1)
{
result = ft_fibonacci(index - 1) + ft_fibonacci(index - 2);
}
return (result);
}