-
Notifications
You must be signed in to change notification settings - Fork 0
/
Fibonacci.java
92 lines (82 loc) · 1.71 KB
/
Fibonacci.java
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
import java.util.Scanner;
class Fibonacci
{
static long fibonacci(long n)
{
long firstNumber = 0, secondNumber = 1, nextNumber = 0, i;
for(i=0; i<n; i++)
{
if(i <= 1)
{
nextNumber = i;
}
else
{
nextNumber = firstNumber + secondNumber;
firstNumber = secondNumber;
secondNumber = nextNumber;
}
}
return nextNumber;
}
static void generateFibonacciSeriesUptoN(long n)
{
long i = 1;
System.out.println("\n Fibonnaci Series upto "+ n + " : ");
while(fibonacci(i) <= n)
{
System.out.print(" "+fibonacci(i));
i++;
}
System.out.println("\n");
}
static void generateFirstNNumbersOfFibonacci(long n)
{
long i = 1;
System.out.println("\n Fibonnaci Series for the first "+ n + " numbers : ");
for (long c = 1 ; c <= n ; c++ )
{
System.out.print(" "+fibonacci(i));
i++;
}
System.out.println("\n");
}
public static void main(String args[])
{
int option;
long n;
System.out.println("\n 1. Print first n numbers of Fibonacci series.\n\n 2. Print the Fibonacci series upto a particular number n\n\n Choose your option (1 or 2) : ");
Scanner scanner = new Scanner(System.in);
try
{
option = scanner.nextInt();
if(option != 1 && option != 2)
{
while(option != 1 && option != 2)
{
System.out.println("\n Enter a valid option 1 or 2 : ");
option = scanner.nextInt();
}
}
System.out.println("\n Enter the n value : ");
try
{
n = scanner.nextLong();
if(option == 1)
{
generateFirstNNumbersOfFibonacci(n);
}
else
{
generateFibonacciSeriesUptoN(n);
}
}
catch(Exception e)
{
}
}
catch(Exception e)
{
}
}
}