/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

2 votes305 views1 answer
Java resize image
Java
0 vote308 views1 answer
Txt to Json in java
Java
0 vote333 views1 answer
V2ray
Java
0 vote309 views1 answer
Build cmake gradle
Java
0 vote315 views1 answer
How to disable coming back to activity android studio
Java
1 vote314 views1 answer
Get value textfield java
Java
1 vote378 views2 answers
Java get month
Java
2 votes332 views1 answer
Hibernate select count
Java
4 votes337 views2 answers
Java array get index
Java
0 vote288 views1 answer
Turning a sentence to an array java
Java