fibonacci series
# Easy fibonacci exercise
# Method #1
def fibonacci(n):
# 1th: 0
# 2th: 1
# 3th: 1 ...
if n == 1:
return 0
elif n == 2:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2)
# Method #2
def fibonacci2(n):
if n == 0: return 0
n1 = 1
n2 = 1
# (1, n - 2) because start by 1, 2, 3... not 0, 1, 1, 2, 3....
for i in range(1, n - 2):
n1 += n2
n2 = n1 - n2
return n1
print(fibonacci(13))
# return the nth element in the fibonacci sequence
0
1
//to find nth fibonacci number(recursive solution)
class Solution {
public int fib(int n) {
if(n==0){
return 0;
}
if(n==1){
return 1;
}
if(n==2){
return 1;
}
return fib(n-1)+fib(n-2);
}
}
Thank you!
1
0
4.67
6
class Solution {
public int fib(int n) {
if(n==0){
return 0;
}
if(n==1){
return 1;
}
if(n==2){
return 1;
}
return fib(n-1)+fib(n-2);
}
}
Thank you!
6
0
4
6
// FIBONACCI SERIES
// 0 1 1 2 3 5 8 13
let number = 7;
// let a=0,b =1,next;
let a=-1,b=1,next;
for(let i=1;i<=number;i++){
next= a + b;
a = b;
b = next
console.log(next)
}
Thank you!
6
0
5
1
// Fibonacci Series
0,1,1,2,3,5,8,13,21,34,55,89,144......
Thank you!
1
0
4.11
9
//basic fibonacci series
0, 1, 1, 2, 3, 5, 8, 13, 21, ...
Thank you!
9
0
Are there any code examples left?
New code examples in category Other