Java Basic
Java Interview Programs
- Java Interview Programs
- Java Abundant Number
- Java Amicable Number
- Java Armstrong Number
- Java Average of N Numbers
- Java Automorphic Number
- Java Biggest of three numbers
- Java Binary to Decimal
- Java Common Divisors
- Java Composite Number
- Java Condense a Number
- Java Cube Number
- Java Decimal to Binary
- Java Decimal to Octal
- Java Disarium Number
- Java Even Number
- Java Evil Number
- Java Factorial of a Number
- Java Fibonacci Series
- Java GCD
- Java Happy Number
- Java Harshad Number
- Java LCM
- Java Leap Year
- Java Magic Number
- Java Matrix Addition
- Java Matrix Division
- Java Matrix Multiplication
- Java Matrix Subtraction
- JS Matrix Transpose
- Java Maximum Value of an Array
- Java Minimum Value of an Array
- Java Multiplication Table
- Java Natural Number
- Java Number Combination
- Java Odd Number
- Java Palindrome Number
- Java Pascalβs Triangle
- Java Perfect Number
- Java Perfect Square
- Java Power of 2
- Java Power of 3
- Java Pronic Number
- Java Prime Factor
- Java Prime Number
- Java Smith Number
- Java Strong Number
- Java Sum of Array
- Java Sum of Digits
- Java Swap Two Numbers
- Java Triangular Number
Java Program to Display Fibonacci Series
Photo Credit to CodeToFun
π Introduction
The Fibonacci series is a sequence of numbers in which each number is the sum of the two preceding ones, usually starting with 0 and 1.
This series has widespread applications in various fields, including mathematics and computer science.
In this tutorial, we'll explore a Java program that generates and displays the Fibonacci series.
π Example
Let's delve into the Java code that generates and displays the Fibonacci series.
public class FibonacciSeries {
// Function to display Fibonacci series up to n terms
static void displayFibonacci(int n) {
int first = 0, second = 1, next;
System.out.print("Fibonacci series up to " + n + " terms: ");
for (int i = 0; i < n; ++i) {
System.out.print(first + ", ");
next = first + second;
first = second;
second = next;
}
System.out.println();
}
// Driver program
public static void main(String[] args) {
// Replace this value with the desired number of terms
int terms = 10;
// Call the function to display Fibonacci series
displayFibonacci(terms);
}
}
π» Testing the Program
To test the program with a different number of terms, simply replace the value of the terms variable in the main method.
Fibonacci series up to 10 terms: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,
Compile and run the program to see the Fibonacci series up to the desired number of terms.
π§ How the Program Works
- The program defines a class FibonacciSeries containing a static method displayFibonacci that takes the number of terms (n) as input and prints the Fibonacci series up to n terms.
- Inside the method, it initializes variables first and second with 0 and 1, respectively.
- It then uses a loop to calculate and print the Fibonacci series up to the specified number of terms.
- The loop updates the values of first and second in each iteration to generate the next Fibonacci number.
π§ Understanding the Concept of Fibonacci Series
The Fibonacci series starts with 0 and 1. Each subsequent number in the series is the sum of the two preceding ones. The series begins as follows:
0, 1, 1, 2, 3, 5, 8, 13, 21, ...
π’ Optimizing the Program
While the provided program is straightforward, consider exploring and implementing optimizations for larger Fibonacci series, such as using memoization techniques to avoid redundant calculations.
Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!
π¨βπ» Join our Community:
Author
For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.
Buy me a coffee to make codetofun.com free for everyone.
Buy me a Coffee
If you have any doubts regarding this article (Java Program to Display Fibonacci Series), please comment here. I will help you immediately.