/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 vote156 views1 answer
Spring Boot - Hashicorp Vault Integration
Java
1 vote151 views1 answer
Java real random
Java
7 votes145 views1 answer
Byte java
Java
1 vote146 views6 answers
Roblox.com
Java
0 vote141 views1 answer
Vue input pre initial value
Java
0 vote156 views1 answer
Test thrown expected with jupiter spring boot
Java
0 vote137 views1 answer
Android pick up photo from local device
Java
0 vote133 views1 answer
Java singly linked list example 2 res
Java
-1 vote131 views1 answer
$CATALINA_HOME/RUNNING.txt
Java
0 vote147 views1 answer
See date in java
Java