- HubPages»
- Technology»
- Computers & Software»
- Computer Science & Programming»
- Programming Languages
Fibonacci Java Program: Complete Program for Fibonacci Series
Java Program for Fibonacci Series
Fibonacci is the sequence of number, which has 2 forms, first is the sequence that begins in 0 and the second form is the sequence that begins in 1. After the constants, the following number is the sum of the first 2 previous numbers. For example:
The constants in Fibonacci Series are:
Fib0 = 0;
Fib1 = 1;
Fib2 = 2;
So, if the next sequence is the sum of the first 2 numbers in the sequence, then, Fib3, Fib4 and Fib5 will be:
Fib3 = Fib1 + Fib2;
Fib4 = Fib2 + Fib3;
Fib5 = Fib3 + Fib4;
And so on…
Thus, Fibonacci Series is easy to predict if you know its rules of sequences. It is also easy to program in Java.
Example Fibonacci Series of Number 8
Fib0
| Fib1
| Fib2
| Fib3
| Fib4
| Fib5
| Fib6
| Fib7
| Fib8
|
|---|---|---|---|---|---|---|---|---|
0
| 1
| 1
| 2
| 3
| 5
| 8
| 13
| 21
|
Example Fibonacci Series of Number 10
Fib0
| Fib1
| Fib2
| Fib3
| Fib4
| Fib5
| Fib6
| Fib7
| Fib8
| Fib9
| Fib10
|
|---|---|---|---|---|---|---|---|---|---|---|
0
| 1
| 1
| 2
| 3
| 5
| 8
| 13
| 21
| 34
| 55
|
Fibonacci Java Program Algorithm:
The Java Program for Fibonacci that will be given here is to look for the Fibonacci series of the number that will be entered by the user. Example: 8, the program should return the numbers shown in the Fibonacci series of the number 8 above. The program would test the number 8 and number 10 and let us see if it returns the same as shown on the table.
Java Source Code for Fibonacci Series
// packageName: fib
package fib;
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
System.out.print("Enter a number: ");
int entered_num= input.nextInt();
System.out.println("The Fibonacci Sequence of the Number " + entered_num + " is:");
int constant1 = 1;
int constant2= 1;
int nextNumber = 0;
int count=0;
for (int i=0;i<=entered_num;i++)
{
System.out.println("F" + count + "=" + nextNumber);
constant1 = constant2;
constant2 = nextNumber;
nextNumber = constant1 + constant2;
count++;
}
}
}
Sample Output:
It works! Check and trace the code on how the program works. Try it on your Java IDE. Happy Programming!
Related Java tutorials
- 5 Important Tips to Learn Java Programming and Other Programming Languages
- Basic Knowledge Required in Programming
- How to Program in Java Using Netbeans: Complete Simple Easy Steps
- Java Simple Codes for Beginners
- Java Tutorial for Beginners: A Beginners Guide on Learning Java Programming
- Java Tutorial Examples
Other Java Source Codes
- Java Program: How to Use If Statement in Java Programming
- Java Program: How to Use If-Else Statement in Java Programming
- Java Program: Using Multi If and Else Statement in Java Programming
- Java Program: How to Use Switch Statement in Java
- Java Program: How to Parse a String into Integer in Java Programming
- Java Program: Count the Number of String Characters in Java
- Java Program: Reverse String in Java Using For Loop
- Java Program: Palindrome Test Java Source Code
- Java Program: How to Sort Numbers in an Array in a Descending Order
- Java Program: How to Sort Numbers in Ascending Order
- Sample Java Program for String Tokenizer
- Sample Program for JOptionpane and Java Source Code for Basic Calculator
- What is a Java Scanner Class and How to Use it?
- What is MDAS? Sample Java Source Code for MDAS
- What is a Static Method in Java?
- Casting in Java
- BufferedReader in Java
- Java Source code sample: How to Add Numbers inside an Array using For Loop
- Java Source code: How to Add numbers inside an Array Using Recursion
Related
Programming in Java Netbeans - A Step by Step Tutorial for Beginners: Lesson 27
Fibonacci Sequence (Definition, Formula and Examples)
Programming in Java Netbeans - A Step by Step Tutorial for Beginners: Lesson 37
Programming in Java Netbeans - A Step by Step Tutorial for Beginners: Lesson 29
Programming in Java Netbeans - A Step by Step Tutorial for Beginners: Lesson 8
