/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 vote208 views1 answer
How to get orientation lock to portrait android stackoverflow
Java
0 vote208 views1 answer
Important features of java programming language
Java
1 vote226 views1 answer
Java list addAll stream() filtereted
Java
-3 votes252 views5 answers
Pasar ejercicios de pseint a java
Java
0 vote242 views1 answer
How to fix javax.validation.constraints.Email
Java
1 vote191 views1 answer
Attempt to invoke virtual method 'int java.util.Random.nextInt(int)' on a null object reference
Java
0 vote217 views2 answers
Lopping rows rethinkdb
Java
3 votes227 views2 answers
Random boolean java
Java
0 vote217 views1 answer
Don't use a line-beased input after a token-based input.
Java
4 votes215 views2 answers
Java klasse
Java