/Java/Fibonacci numbers using Recursion in Java

Fibonacci numbers using Recursion in Java

import java.util.*;
public class fibonacci{
    public static void main(String args[]){
        int n;
        Scanner sc= new Scanner(System.in);
        n=sc.nextInt();
        sc.close();
        System.out.println(fibo(n));
    }
    public static int fibo(int n){
        if(n==1)return 0;
        else if(n==2)return 1;
        else{
            return fibo(n-1)+fibo(n-2);
        }
    }
}

Source: scaler.com

Similar codes

0 vote212 views1 answer
Log10 in java
Java
0 vote175 views1 answer
Parentheses in java
Java
7 votes246 views3 answers
Java measure execution time
Java
0 vote234 views1 answer
Selenium java wait for page load
Java
0 vote234 views1 answer
Add checkbox box rows in tabulator
Java
0 vote216 views1 answer
Javax.servlet.ServletException: javax.servlet.jsp.JspException: Missing message for key
Java
0 vote218 views1 answer
Java resultset.absolute
Java
0 vote220 views2 answers
Android java update image dynamically
Java
0 vote215 views1 answer
How to check if a player has broken a block spigot
Java
0 vote229 views3 answers
Diiferent ways to run spring boot
Java