JavaAlgorithms/Others/FibbonaciSeries.java

31 lines
882 B
Java
Raw Normal View History

package Others;
import java.util.Scanner;
/**
2020-10-24 18:23:28 +08:00
* Fibonacci sequence, and characterized by the fact that every number after the first two is the
* sum of the two preceding ones.
*
* <p>Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,...
*
* <p>Source for the explanation: https://en.wikipedia.org/wiki/Fibonacci_number
*
* Problem Statement: print all Fibonacci numbers that are smaller than your given input N
*/
public class FibbonaciSeries {
2020-10-24 18:23:28 +08:00
public static void main(String[] args) {
// Get input from the user
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
2020-10-24 18:23:28 +08:00
int first = 0, second = 1;
scan.close();
while (first <= n) {
2020-10-24 18:23:28 +08:00
// print first fibo 0 then add second fibo into it while updating second as well
System.out.println(first);
int next = first + second;
first = second;
second = next;
}
2020-10-24 18:23:28 +08:00
}
}