/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 vote234 views1 answer
Hackerrank valid username regular expression
Java
0 vote232 views1 answer
Java int stream min
Java
0 vote249 views1 answer
Define a list java
Java
0 vote241 views1 answer
Spring boot MVC config
Java
1 vote247 views1 answer
Execute application jar
Java
0 vote350 views1 answer
Spring websocket allow origin
Java Spring
-2 votes236 views2 answers
Python to java code conversion
Java
1 vote253 views1 answer
Convert datetime to custom format in java 8
Java
1 vote237 views1 answer
Context error in android studio
Java
0 vote240 views1 answer
Empty map entry java
Java