/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

15 votes166 views2 answers
Java get first char
Java
3 votes167 views2 answers
How to get the max value of an array java
Java
0 vote155 views1 answer
How to check the current user in firebase android
Java
0 vote178 views1 answer
Positive numbers in array
Java
0 vote128 views1 answer
Javafx radio button toggle group
Java
0 vote169 views1 answer
Install oracle java ubuntu 20.04
Java
3 votes186 views1 answer
Java read string input
Java
1 vote181 views1 answer
Clear array java
Java
3 votes132 views2 answers
While loop java multiple conditions
Java
0 vote171 views10 answers
Bruh
Java