In this article we will learn to implement a Java program to print the nth element in the Fibonacci series. A Java program is provided below to print the nth element in the Fibonacci series using both non-recursive and recursive methods.
Program is as follows:
import java.util.*;
class Fibonnaci
{
int nFib(int n)
{
int a = 0, b = 1, c=0;
if(n == 1)
return 0;
else if(n == 2)
return 1;
else
{
for(int i = 2; i < n; i++)
{
c = a+b;
a = b;
b = c;
}
return c;
}
}
int rFib(int n)
{
if(n == 1)
return 0;
else if(n == 2)
return 1;
else
{
return rFib(n-1)+rFib(n-2);
}
}
}
class Driver
{
public static void main(String[] args)
{
Fibonnaci f = new Fibonnaci();
Scanner s = new Scanner(System.in);
System.out.println("Enter the value of n: ");
int n = s.nextInt();
System.out.println("Element using normal method is: "+f.nFib(n));
System.out.println("Element using recursive method is: "+f.rFib(n));
}
}
Input and output for the above program is as follows:
Enter the value of n:
5
Element using normal method is: 3
Element using recursive method is: 3
Suryateja Pericherla, at present is a Research Scholar (full-time Ph.D.) in the Dept. of Computer Science & Systems Engineering at Andhra University, Visakhapatnam. Previously worked as an Associate Professor in the Dept. of CSE at Vishnu Institute of Technology, India.
He has 11+ years of teaching experience and is an individual researcher whose research interests are Cloud Computing, Internet of Things, Computer Security, Network Security and Blockchain.
He is a member of professional societies like IEEE, ACM, CSI and ISCA. He published several research papers which are indexed by SCIE, WoS, Scopus, Springer and others.
Leave a Reply