forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFibbonaciSeries.java
More file actions
30 lines (28 loc) · 882 Bytes
/
FibbonaciSeries.java
File metadata and controls
30 lines (28 loc) · 882 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
package Others;
import java.util.Scanner;
/**
* 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 {
public static void main(String[] args) {
// Get input from the user
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int first = 0, second = 1;
scan.close();
while (first <= n) {
// 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;
}
}
}