algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-24 21:14:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

Formatted with Google Java Formatter

Browse Source
This commit is contained in:
github-actions
2020-10-24 10:23:28 +00:00
parent a23bac99e8
commit 5d59a2e828
219 changed files with 13758 additions and 14582 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
Others/FibToN.java
View File

@ -3,31 +3,29 @@ 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
* 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
*/
public class FibToN {
public static void main(String[] args) {
//take input
Scanner scn = new Scanner(System.in);
int N = scn.nextInt();
// print all Fibonacci numbers that are smaller than your given input N
int first = 0, second = 1;
scn.close();
while (first <= N) {
//print first fibo 0 then add second fibo into it while updating second as well
public static void main(String[] args) {
// take input
Scanner scn = new Scanner(System.in);
int N = scn.nextInt();
// print all Fibonacci numbers that are smaller than your given input N
int first = 0, second = 1;
scn.close();
while (first <= N) {
// print first fibo 0 then add second fibo into it while updating second as well
System.out.println(first);
System.out.println(first);
int next = first + second;
first = second;
second = next;
}
int next = first + second;
first = second;
second = next;
}
}
}