/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 vote119 views2 answers
Map string list string in java
Java
0 vote143 views1 answer
Original authors: Talmon Marco, Igor Magazinnik Programming languages: Java, C, Python, C , Qt, Objective-C
Java
0 vote121 views1 answer
Android videoview not smooth for mp4
Java
0 vote105 views2 answers
Convert python code to java using jython
Java
0 vote116 views1 answer
Richest customer wealth leetcode
Java
0 vote110 views1 answer
Java program to print the character or a letter x using star
Java
0 vote152 views1 answer
Java get all directories in path
Java
33 votes111 views4 answers
Bootstrap errors
Java
2 votes123 views3 answers
Java check ipv6 with regex
Java
0 vote182 views1 answer
Configuration spring boot dependency for freemarker configuration
Java