-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFibonacci.java
More file actions
65 lines (60 loc) · 1.55 KB
/
Fibonacci.java
File metadata and controls
65 lines (60 loc) · 1.55 KB
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*
* Program to find the Fibonacci series:
* Write a Java program to generate the Fibonacci series up to a specified limit.
*/
import java.util.Scanner;
public class Fibonacci
{
public static int getFibonacciRecursion(int n)
{
if (n <= 1)
{
return n;
}
else
{
return getFibonacciRecursion(n - 1) + getFibonacciRecursion(n - 2);
}
}
public static void getFibonacci(int n)
{
int a, b;
System.out.println("The fibonacci series upto "+n+" (without recursion) is: ");
if(n == 1)
{
System.out.println("0");
}
else
{
a = 0;
b = 1;
System.out.print(a+" "+b+" ");
if(n>=2)
{
//System.out.print(a+" "+b+" ");
int c = a+b;
while(c<n)
{
System.out.print(c+" ");
a =b;
b = c;
c = a+b;
}
}
}
System.out.println("");
}
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter the limit: ");
int n = sc.nextInt();
sc.close();
getFibonacci(n);
System.out.println("The fibonacci series upto "+n+" (using recursion) is: ");
for (int i = 0; getFibonacciRecursion(i) < n; i++)
{
System.out.print(getFibonacciRecursion(i) + " ");
}
}
}