Scribd
Upload
37 views1 page

Java Fibonacci Series with Recursion

This Java program uses recursion to display the Fibonacci series. It takes user input for the number of terms, calls a recursive fib() method to calculate each term, and prints the series. The fib() method bases each calculation on the previous two terms, returning either the parameter for the first two cases or summing the results of recursively calling itself for the previous two numbers otherwise.

Uploaded by

Shiva Prasad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
37 views1 page

Java Fibonacci Series with Recursion

This Java program uses recursion to display the Fibonacci series. It takes user input for the number of terms, calls a recursive fib() method to calculate each term, and prints the series. The fib() method bases each calculation on the previous two terms, returning either the parameter for the first two cases or summing the results of recursively calling itself for the previous two numbers otherwise.

Uploaded by

Shiva Prasad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

/* A JAVA PROGRAM TO DISPLAY FIBNOCCI SERIES USING RECURSION METHOD*/

import [Link].*;
public class Fibnocci
{
public static void main(String[] args)
{
int n,i;
Scanner s=new Scanner ([Link]);
[Link]("enter a number");
n=[Link]();
[Link]("fibnocci series: ");
for(i=0;i<n;i++)

[Link](fib(i)+"\t");
}
static int fib(int n)
{
if(n==0 || n==1)
return n;
else
return(fib(n-1)+fib(n-2));
}
}
/*OUTPUT:
Enter a number
10
fibnocci series:
0 1 1 2 3 5 8 13 21 34
*/

SHIVANI.G
18251A1214
IT-A

You might also like