/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

1 vote196 views1 answer
Catch array out of bounds exception java
Java
5 votes187 views2 answers
Why main method is public static void in java
Java
0 vote185 views1 answer
Open bottomsheet from adapter java
Java
1 vote181 views1 answer
Bungeecord plugin add configs
Java
1 vote199 views2 answers
Input arraylist in java
Java
0 vote177 views1 answer
Java reverse loop
Java
1 vote225 views1 answer
The this(Keyword)
Java
12 votes366 views3 answers
Specify decimal places java
Java
0 vote191 views1 answer
New string' is redundant error
Java
0 vote188 views1 answer
Install java debian 8
Java