Skip to content

added Fibonacci.java which uses a recursive function #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

added Fibonacci.java which uses a recursive function #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
26 changes: 26 additions & 0 deletions java/Fibonacci.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
/* This program uses a recursive function to find the number present at the given position in the Fibonacci series */

import java.util.*;

public class Fibonacci {
public static long fib(long n) {
if ((n == 0) || (n == 1))
return n;
else
return fib(n - 1) + fib(n - 2);
}
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Please Enter the Position:");
int pos=sc.nextInt();
if (pos == 1)
System.out.println("The " + pos + "st fibonacci number is: " + fib(pos));
if (pos == 2)
System.out.println("The " + pos + "nd fibonacci number is: " + fib(pos));
if (pos == 3)
System.out.println("The " + pos + "rd fibonacci number is: " + fib(pos));
else
System.out.println("The " + pos + "th fibonacci number is: " + fib(pos));
}
}