/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

4 votes354 views5 answers
Java background color
Java
0 vote443 views1 answer
Bad JNI version returned from JNI_OnLoad in
Java
36 votes364 views4 answers
Java generate random integer in range
Java
1 vote372 views2 answers
On touch listener android
Java
3 votes337 views1 answer
Javafx center node in gridpane
Java
4 votes399 views2 answers
Append to file in java
Java
55 votes346 views4 answers
How to get last element in java
Java
-1 vote368 views2 answers
Spring boot fix cors problem
Java
0 vote341 views1 answer
Arrotondare un numero a 2 cifre dopo la virgola java
Java
17 votes369 views2 answers
Java constructor
Java