-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFibonacci.java
More file actions
38 lines (38 loc) · 1.12 KB
/
Fibonacci.java
File metadata and controls
38 lines (38 loc) · 1.12 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
// Program: Generate Fibonacci Series Using Recursion
// Topic: Recursion and Number Series
// Description: Reads a number ‘n’ from user input and prints the first ‘n’ Fibonacci numbers using a recursive method `fib()`.
// Demonstrates base and recursive cases to compute Fibonacci terms as `fib(n) = fib(n-1) + fib(n-2)`.
// Highlights recursion depth, stack calls, and iterative printing of the generated sequence.
package recursion;
import java.util.*;
/**
*
* @author Samim
*/
public class Fibonacci
{
public int fib(int n)
{
if(n<=1)
{
return n;
}
else
{
return fib(n-1)+fib(n-2);
}
}
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n;
System.out.println("Enter Number Of terms :");
n=sc.nextInt();
Fibonacci obj=new Fibonacci();
System.out.println("Even fibonacci Numbers :");
for(int i=1;i<=n;i++)
{
System.out.println(obj.fib(i));
}
}
}