Here's A Java Program That Generates The Fibonacci Series:
```Java
Import Java.Util.Scanner;
Public Class Fibonacciseries {
Public Static Void Main(String[] Args) {
Scanner Input = New Scanner(System.In);
System.Out.Print("Enter The Number Of Terms: ");
Int Numterms = Input.Nextint();
System.Out.Println("Fibonacci Series:");
For (Int I = 0; I < Numterms; I++) {
System.Out.Print(Fibonacci(I) + " ");
}
}
Public Static Int Fibonacci(Int N) {
If (N <= 1) {
Return N;
} Else {
Return Fibonacci(N - 1) + Fibonacci(N - 2);
}
}
}
```
In This Program, We Prompt The User To Enter The Number Of Terms They Want In The Fibonacci Series. Then, We Use A `For` Loop To Iterate From 0 To The Specified Number Of Terms. Inside The Loop, We Call The `Fibonacci()` Method To Calculate The Fibonacci Number At Each Position And Print It.
The `Fibonacci()` Method Is Implemented Using Recursion. It Takes An Integer `N` As Input And Returns The Fibonacci Number At Position `N`. If `N` Is Less Than Or Equal To 1, We Simply Return `N` Since The Fibonacci Series Starts With 0 And 1. Otherwise, We Recursively Call The `Fibonacci()` Method With `N-1` And `N-2`, And Return The Sum Of The Two Previous Fibonacci Numbers.
Hope This Helps! Let Me Know If You Have Any Further Questions.

No comments:
Post a Comment