fibbonacci
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811,fibbonacci
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811,fibonacci
# 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 sequencefibonacci sequence
public class Numbers {
public static void FibannaciNumbers(int n) {
int x = 0;
int y = 1;
if(n >= 1) {
System.out.print(x + " ");
}
if(n >= 2) {
System.out.print(y);
}
if (n > 2) {
for(int a = n - 2; a > 0; a--) {
int z = y + x;
System.out.print(" " + z);
x = y;
y = z;
}
}
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
