/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 votes149 views2 answers
Java time program
Java
0 vote200 views1 answer
How-to-check-internet-connection-in-android
Java
0 vote235 views1 answer
Mobile view next and previous button
Java
0 vote170 views1 answer
Multiple recyclerview not scrolling bottom sheet
Java
18 votes205 views2 answers
Add retrofit dependency android
Java
0 vote202 views1 answer
Timer tick java
Java
4 votes194 views2 answers
Close scanner java
Java
2 votes228 views1 answer
Mapping int to int (in Java)
Java
1 vote186 views1 answer
How to find the largest number in a 2d array java
Java
7 votes198 views1 answer
Java for character c in string iterate cout i
Java