-
Notifications
You must be signed in to change notification settings - Fork 0
/
FibonacciSeries.java
51 lines (45 loc) · 1.06 KB
/
FibonacciSeries.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
package com.algorithm.Recursion;
/*
*Program for Fibonacci numbers
*/
public class FibonacciSeries {
static double nthFibNumber(int num) {
double nth = 0;
if (num < 1) {
System.out.print("Fibonacci series only for +tive number or greater than 0");
return nth;
}
if (num == 1 || num == 2) {
nth = num - 1;
} else {
nth = nthFibNumber(num - 1) + nthFibNumber(num - 2);
}
return nth;
}
// fibSeries
static void fibSeries(int num) {
int a = 0;
int b = 1;
int c;
if (num < 1 || num == 0) {
System.out.println(0);
}
System.out.println(0);
for (int i = 2; i <= num; i++) {
c = a + b;
a = b;
b = c;
System.out.println(c);
}
}
public static void main(String[] args) {
/*
* Fn = Fn-1 + Fn-2 where F0 = 0 and F1 = 1. A Series of numbers in which each
* number is the sum of the two preceding numbers First two numbers by
* definitipon 0 and 1; eg .0,1,1,2,3,5,8,13,21,34...
*/
System.out.println("Fibonacci Series for ---");
fibSeries(10);
System.out.println("Last digit of --" + nthFibNumber(10));
}
}