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

Rename FibToN.java to FibbonaciSeries.java (#2498)

Browse Source
This commit is contained in:
Brunda M Bharadwaj
2021-10-10 11:13:28 +05:30
committed by GitHub
parent f1ec159d85
commit 776c3c615d
1 changed files with 8 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
Others/FibToN.java → Others/FibbonaciSeries.java
View File

@ -9,20 +9,19 @@ import java.util.Scanner;
* <p>Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,... * <p>Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,...
* *
* <p>Source for the explanation: https://en.wikipedia.org/wiki/Fibonacci_number * <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 FibToN { public class FibbonaciSeries {
public static void main(String[] args) { public static void main(String[] args) {
// take input // Get input from the user
Scanner scn = new Scanner(System.in); Scanner scan = new Scanner(System.in);
int N = scn.nextInt(); int n = scan.nextInt();
// print all Fibonacci numbers that are smaller than your given input N
int first = 0, second = 1; int first = 0, second = 1;
scn.close(); scan.close();
while (first <= N) { while (first <= n) {
// print first fibo 0 then add second fibo into it while updating second as well // 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; int next = first + second;
first = second; first = second;
second = next; second = next;