fibunacci java
// WARNING: The function assumes that 'fib(0)=0' and 'fib(1)=1'
// Returns the number of the fibonacci sequence at index 'n'
public static int fib(int n) {
if (n < 2) // No difference if '<' or '<=', because 'fib(2)=2'.
return n;
return fib(n-1) + fib(n-2); // Uses the recursion method for solving
}fibonacci series in java
// fibonacci series in java using while loop
public class FibonacciSeriesWhileLoop
{
public static void main(String[] args)
{
int a = 1, num = 15, num1 = 0, num2 = 1;
System.out.print("First " + num + " fibonacci sequence: ");
while(a <= num)
{
System.out.print(num1 + " , ");
int total = num1 + num2;
num1 = num2;
num2 = total;
a++;
}
}
}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
