/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 vote174 views1 answer
How to register event spiot
Java
0 vote178 views1 answer
Subtract two variables in java
Java
2 votes167 views3 answers
String array to arraylist android
Java
0 vote204 views1 answer
Access db in fragments
Java
0 vote189 views1 answer
Clear a list in java
Java
1 vote184 views1 answer
Spigot despawn entity
Java
0 vote166 views1 answer
How to print all package in java
Java
0 vote188 views2 answers
Unable to find bundled Java version mac m1
Java
0 vote178 views1 answer
Function compose method java 8
Java
0 vote177 views1 answer
How to catch enter key in java text field
Java