fibonacci 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;
}
}
}
}fibonacci sequence
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...fibonacci sequence
def fibonacci(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n-1) + fibonacci(n-2)fibonacci sequence
//x is the index number in the fibonnacci sequence.
//The function will return that index's fibonacci value
function fib(x) {
let a = 0;
let b = 1;
for (var i = 0; i < x-1; i++) {
let c = b;
b += a;
a = c;
}
return b;
}fibonacci sequence
// Copy paste code here https://play.golang.org/
package main
import "fmt"
func fibo(n int) int {
x, y := 0, 1
for i := 0; i < n; i++ {
x, y = y, x+y
}
return x
}
func main() { fmt.Println(fibo(5)) } // return 5fibonacci sequence
// Copy pastecode here https://play.golang.org/
package main
import "fmt"
func fibo(n int) int {
x, y := 0, 1
for i := 0; i < n; i++ {
x, y = y, x+y
}
return x
}
func main() {
for i := 0; i < 10; i++ {
fmt.Println("fibo of", i, "is", fibo(i))
}
}Fibonacci sequence
function myFib(n) {
if (isNaN(n) || Math.floor(n) !== n)
return "Not an integer value!";
if (n === 0 || n === 1)
return 3;
else
return myFib(n - 1) + myFib(n - 2);
}
console.log(myFib(5));fibonacci sequence
int n ;
double feb = (1/Math.pow(5,0.5)) * (Math.pow((1+Math.pow(5,0.5))/2,n)) - (1/Math.pow(5,0.5))* (Math.pow((1-Math.pow(5,0.5))/2,n));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
