mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-05 16:27:33 +08:00
Rename Recursion
package (#6081)
This commit is contained in:
@ -1,37 +0,0 @@
|
|||||||
package com.thealgorithms.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 final class FibbonaciSeries {
|
|
||||||
private 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;
|
|
||||||
int 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;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,4 +1,4 @@
|
|||||||
package com.thealgorithms.Recursion;
|
package com.thealgorithms.recursion;
|
||||||
|
|
||||||
/*
|
/*
|
||||||
The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones,
|
The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones,
|
@ -1,4 +1,4 @@
|
|||||||
package com.thealgorithms.Recursion;
|
package com.thealgorithms.recursion;
|
||||||
|
|
||||||
// program to find power set of a string
|
// program to find power set of a string
|
||||||
|
|
@ -1,4 +1,4 @@
|
|||||||
package com.thealgorithms.Recursion;
|
package com.thealgorithms.recursion;
|
||||||
|
|
||||||
import static org.junit.jupiter.api.Assertions.assertEquals;
|
import static org.junit.jupiter.api.Assertions.assertEquals;
|
||||||
|
|
@ -1,4 +1,4 @@
|
|||||||
package com.thealgorithms.Recursion;
|
package com.thealgorithms.recursion;
|
||||||
|
|
||||||
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
|
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
|
||||||
|
|
Reference in New Issue
Block a user