/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

12 votes318 views2 answers
Sleep() java
Java
0 vote346 views1 answer
Runnable java
Java
1 vote389 views1 answer
Volatile in java
Java
0 vote328 views1 answer
Fab to CircularRevealFrameLayout example
Java
1 vote318 views1 answer
Xlint:deprecation android studio
Java
2 votes355 views1 answer
How to make java list
Java
0 vote303 views1 answer
Android activity set action bar options
Java
1 vote321 views1 answer
Android ancestor navigation
Java
0 vote360 views1 answer
Arraylist character agregar elementos en java
Java
-2 votes301 views1 answer
How to implements interface in java
Java