/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 vote352 views1 answer
Print java object inherited classes
Java
0 vote381 views2 answers
Convert
Java
0 vote354 views1 answer
Don't use a line-beased input after a token-based input.
Java
1 vote364 views2 answers
Delete ending part of the string java
Java
0 vote352 views1 answer
Java plugin spigot messsage console
Java
3 votes313 views1 answer
Remove event listener
Java
0 vote362 views1 answer
Javafx choicebox get index
Java
0 vote371 views1 answer
Pioneer meaning
Java
0 vote346 views1 answer
Could not initialize defaultkotlinsourcesetkt intelij
Java
0 vote359 views1 answer
How to read file from console in java
Java